/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:37:48,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:37:48,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:37:48,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:37:48,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:37:48,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:37:48,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:37:48,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:37:48,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:37:48,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:37:48,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:37:48,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:37:48,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:37:48,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:37:48,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:37:48,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:37:48,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:37:48,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:37:48,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:37:48,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:37:48,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:37:48,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:37:49,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:37:49,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:37:49,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:37:49,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:37:49,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:37:49,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:37:49,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:37:49,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:37:49,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:37:49,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:37:49,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:37:49,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:37:49,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:37:49,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:37:49,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:37:49,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:37:49,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:37:49,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:37:49,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:37:49,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:37:49,051 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:37:49,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:37:49,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:37:49,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:37:49,056 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:37:49,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:37:49,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:37:49,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:37:49,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:37:49,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:37:49,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:37:49,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:37:49,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:37:49,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:37:49,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:37:49,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:37:49,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:37:49,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:37:49,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:37:49,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:37:49,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:37:49,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:37:49,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:37:49,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:37:49,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:37:49,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:37:49,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:37:49,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:37:49,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:37:49,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:37:49,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:37:49,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:37:49,393 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:37:49,394 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:37:49,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-27 02:37:49,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65f506d4/18edcb09019e485483d8ea622b24d1c4/FLAG844e38c7e [2019-12-27 02:37:49,964 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:37:49,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2019-12-27 02:37:49,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65f506d4/18edcb09019e485483d8ea622b24d1c4/FLAG844e38c7e [2019-12-27 02:37:50,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f65f506d4/18edcb09019e485483d8ea622b24d1c4 [2019-12-27 02:37:50,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:37:50,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:37:50,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:37:50,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:37:50,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:37:50,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:37:50" (1/1) ... [2019-12-27 02:37:50,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee51f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:50, skipping insertion in model container [2019-12-27 02:37:50,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:37:50" (1/1) ... [2019-12-27 02:37:50,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:37:50,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:37:50,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:37:50,996 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:37:51,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:37:51,138 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:37:51,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51 WrapperNode [2019-12-27 02:37:51,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:37:51,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:37:51,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:37:51,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:37:51,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:37:51,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:37:51,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:37:51,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:37:51,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... [2019-12-27 02:37:51,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:37:51,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:37:51,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:37:51,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:37:51,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:37:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:37:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:37:51,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:37:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:37:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:37:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:37:51,342 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:37:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:37:51,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:37:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:37:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:37:51,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:37:51,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:37:51,346 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:37:52,081 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:37:52,082 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:37:52,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:37:52 BoogieIcfgContainer [2019-12-27 02:37:52,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:37:52,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:37:52,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:37:52,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:37:52,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:37:50" (1/3) ... [2019-12-27 02:37:52,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a40d039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:37:52, skipping insertion in model container [2019-12-27 02:37:52,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:37:51" (2/3) ... [2019-12-27 02:37:52,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a40d039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:37:52, skipping insertion in model container [2019-12-27 02:37:52,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:37:52" (3/3) ... [2019-12-27 02:37:52,092 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2019-12-27 02:37:52,103 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:37:52,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:37:52,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:37:52,113 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:37:52,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,162 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,191 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,192 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,195 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:37:52,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:37:52,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:37:52,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:37:52,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:37:52,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:37:52,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:37:52,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:37:52,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:37:52,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:37:52,253 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 02:37:52,254 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:37:52,350 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:37:52,351 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:37:52,365 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:37:52,385 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 02:37:52,433 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 02:37:52,433 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:37:52,439 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 02:37:52,454 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 02:37:52,455 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:37:57,366 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 02:37:57,486 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:37:57,505 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46792 [2019-12-27 02:37:57,505 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 02:37:57,508 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-27 02:37:58,481 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16134 states. [2019-12-27 02:37:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states. [2019-12-27 02:37:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:37:58,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:37:58,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:37:58,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:37:58,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:37:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1643101290, now seen corresponding path program 1 times [2019-12-27 02:37:58,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:37:58,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208884091] [2019-12-27 02:37:58,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:37:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:37:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:37:58,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208884091] [2019-12-27 02:37:58,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:37:58,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:37:58,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352588434] [2019-12-27 02:37:58,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:37:58,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:37:58,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:37:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:37:58,810 INFO L87 Difference]: Start difference. First operand 16134 states. Second operand 3 states. [2019-12-27 02:37:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:37:59,113 INFO L93 Difference]: Finished difference Result 16034 states and 60310 transitions. [2019-12-27 02:37:59,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:37:59,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:37:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:37:59,412 INFO L225 Difference]: With dead ends: 16034 [2019-12-27 02:37:59,412 INFO L226 Difference]: Without dead ends: 15698 [2019-12-27 02:37:59,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:37:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15698 states. [2019-12-27 02:37:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15698 to 15698. [2019-12-27 02:37:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15698 states. [2019-12-27 02:38:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15698 states to 15698 states and 59106 transitions. [2019-12-27 02:38:00,977 INFO L78 Accepts]: Start accepts. Automaton has 15698 states and 59106 transitions. Word has length 7 [2019-12-27 02:38:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:00,978 INFO L462 AbstractCegarLoop]: Abstraction has 15698 states and 59106 transitions. [2019-12-27 02:38:00,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15698 states and 59106 transitions. [2019-12-27 02:38:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:38:00,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:00,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:00,984 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash 565568960, now seen corresponding path program 1 times [2019-12-27 02:38:00,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:00,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669717971] [2019-12-27 02:38:00,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:01,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669717971] [2019-12-27 02:38:01,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:01,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:01,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373200179] [2019-12-27 02:38:01,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:01,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:01,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:01,125 INFO L87 Difference]: Start difference. First operand 15698 states and 59106 transitions. Second operand 4 states. [2019-12-27 02:38:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:01,596 INFO L93 Difference]: Finished difference Result 24414 states and 88322 transitions. [2019-12-27 02:38:01,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:01,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 02:38:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:01,693 INFO L225 Difference]: With dead ends: 24414 [2019-12-27 02:38:01,693 INFO L226 Difference]: Without dead ends: 24400 [2019-12-27 02:38:01,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24400 states. [2019-12-27 02:38:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24400 to 22284. [2019-12-27 02:38:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22284 states. [2019-12-27 02:38:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22284 states to 22284 states and 81513 transitions. [2019-12-27 02:38:02,692 INFO L78 Accepts]: Start accepts. Automaton has 22284 states and 81513 transitions. Word has length 13 [2019-12-27 02:38:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:02,693 INFO L462 AbstractCegarLoop]: Abstraction has 22284 states and 81513 transitions. [2019-12-27 02:38:02,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:38:02,693 INFO L276 IsEmpty]: Start isEmpty. Operand 22284 states and 81513 transitions. [2019-12-27 02:38:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:38:02,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:02,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:02,696 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:02,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1863901117, now seen corresponding path program 1 times [2019-12-27 02:38:02,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:02,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753304859] [2019-12-27 02:38:02,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:02,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753304859] [2019-12-27 02:38:02,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:02,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:02,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965236118] [2019-12-27 02:38:02,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:02,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:02,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:02,756 INFO L87 Difference]: Start difference. First operand 22284 states and 81513 transitions. Second operand 3 states. [2019-12-27 02:38:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:02,815 INFO L93 Difference]: Finished difference Result 12731 states and 40311 transitions. [2019-12-27 02:38:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:02,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:38:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:03,021 INFO L225 Difference]: With dead ends: 12731 [2019-12-27 02:38:03,021 INFO L226 Difference]: Without dead ends: 12731 [2019-12-27 02:38:03,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2019-12-27 02:38:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 12731. [2019-12-27 02:38:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12731 states. [2019-12-27 02:38:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12731 states to 12731 states and 40311 transitions. [2019-12-27 02:38:03,366 INFO L78 Accepts]: Start accepts. Automaton has 12731 states and 40311 transitions. Word has length 13 [2019-12-27 02:38:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:03,367 INFO L462 AbstractCegarLoop]: Abstraction has 12731 states and 40311 transitions. [2019-12-27 02:38:03,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12731 states and 40311 transitions. [2019-12-27 02:38:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:38:03,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:03,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:03,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash -709244429, now seen corresponding path program 1 times [2019-12-27 02:38:03,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:03,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166888322] [2019-12-27 02:38:03,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:03,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166888322] [2019-12-27 02:38:03,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:03,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:03,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089934751] [2019-12-27 02:38:03,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:38:03,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:38:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:03,427 INFO L87 Difference]: Start difference. First operand 12731 states and 40311 transitions. Second operand 4 states. [2019-12-27 02:38:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:03,453 INFO L93 Difference]: Finished difference Result 1935 states and 4522 transitions. [2019-12-27 02:38:03,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:38:03,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:38:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:03,457 INFO L225 Difference]: With dead ends: 1935 [2019-12-27 02:38:03,458 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 02:38:03,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:38:03,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 02:38:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 02:38:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 02:38:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 4522 transitions. [2019-12-27 02:38:03,493 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 4522 transitions. Word has length 14 [2019-12-27 02:38:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:03,493 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 4522 transitions. [2019-12-27 02:38:03,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:38:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 4522 transitions. [2019-12-27 02:38:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:38:03,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:03,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:03,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1471989024, now seen corresponding path program 1 times [2019-12-27 02:38:03,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:03,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944452879] [2019-12-27 02:38:03,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:03,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944452879] [2019-12-27 02:38:03,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:03,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:38:03,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595374914] [2019-12-27 02:38:03,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:38:03,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:38:03,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:03,603 INFO L87 Difference]: Start difference. First operand 1935 states and 4522 transitions. Second operand 5 states. [2019-12-27 02:38:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:03,629 INFO L93 Difference]: Finished difference Result 652 states and 1532 transitions. [2019-12-27 02:38:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:38:03,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 02:38:03,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:03,631 INFO L225 Difference]: With dead ends: 652 [2019-12-27 02:38:03,631 INFO L226 Difference]: Without dead ends: 652 [2019-12-27 02:38:03,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-12-27 02:38:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 596. [2019-12-27 02:38:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-27 02:38:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1400 transitions. [2019-12-27 02:38:03,642 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1400 transitions. Word has length 26 [2019-12-27 02:38:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:03,642 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1400 transitions. [2019-12-27 02:38:03,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:38:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1400 transitions. [2019-12-27 02:38:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:03,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:03,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:03,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 827870922, now seen corresponding path program 1 times [2019-12-27 02:38:03,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:03,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145934378] [2019-12-27 02:38:03,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:03,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145934378] [2019-12-27 02:38:03,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:03,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:03,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008198687] [2019-12-27 02:38:03,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:03,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:03,727 INFO L87 Difference]: Start difference. First operand 596 states and 1400 transitions. Second operand 3 states. [2019-12-27 02:38:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:03,775 INFO L93 Difference]: Finished difference Result 608 states and 1417 transitions. [2019-12-27 02:38:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:03,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:03,778 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:38:03,778 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:38:03,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:38:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:38:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:38:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1413 transitions. [2019-12-27 02:38:03,789 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1413 transitions. Word has length 55 [2019-12-27 02:38:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:03,789 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1413 transitions. [2019-12-27 02:38:03,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1413 transitions. [2019-12-27 02:38:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:03,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:03,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:03,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash -345025503, now seen corresponding path program 1 times [2019-12-27 02:38:03,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:03,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812642335] [2019-12-27 02:38:03,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:03,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812642335] [2019-12-27 02:38:03,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:03,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:38:03,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106379193] [2019-12-27 02:38:03,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:03,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:03,877 INFO L87 Difference]: Start difference. First operand 604 states and 1413 transitions. Second operand 3 states. [2019-12-27 02:38:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:03,944 INFO L93 Difference]: Finished difference Result 608 states and 1410 transitions. [2019-12-27 02:38:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:03,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:03,946 INFO L225 Difference]: With dead ends: 608 [2019-12-27 02:38:03,946 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 02:38:03,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 02:38:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 604. [2019-12-27 02:38:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 02:38:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1406 transitions. [2019-12-27 02:38:03,959 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1406 transitions. Word has length 55 [2019-12-27 02:38:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:03,959 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1406 transitions. [2019-12-27 02:38:03,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1406 transitions. [2019-12-27 02:38:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:03,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:03,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:03,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash -349465323, now seen corresponding path program 1 times [2019-12-27 02:38:03,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:03,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566605469] [2019-12-27 02:38:03,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:04,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566605469] [2019-12-27 02:38:04,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:04,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:38:04,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752701207] [2019-12-27 02:38:04,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:38:04,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:38:04,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:38:04,083 INFO L87 Difference]: Start difference. First operand 604 states and 1406 transitions. Second operand 5 states. [2019-12-27 02:38:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:04,402 INFO L93 Difference]: Finished difference Result 893 states and 2078 transitions. [2019-12-27 02:38:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:38:04,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 02:38:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:04,404 INFO L225 Difference]: With dead ends: 893 [2019-12-27 02:38:04,404 INFO L226 Difference]: Without dead ends: 893 [2019-12-27 02:38:04,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:38:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-27 02:38:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 718. [2019-12-27 02:38:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 02:38:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1687 transitions. [2019-12-27 02:38:04,422 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1687 transitions. Word has length 55 [2019-12-27 02:38:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:04,422 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1687 transitions. [2019-12-27 02:38:04,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:38:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1687 transitions. [2019-12-27 02:38:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:04,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:04,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:04,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1055549477, now seen corresponding path program 2 times [2019-12-27 02:38:04,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:04,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567145006] [2019-12-27 02:38:04,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:04,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567145006] [2019-12-27 02:38:04,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:04,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:38:04,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506938250] [2019-12-27 02:38:04,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:38:04,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:38:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:38:04,585 INFO L87 Difference]: Start difference. First operand 718 states and 1687 transitions. Second operand 6 states. [2019-12-27 02:38:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:04,918 INFO L93 Difference]: Finished difference Result 989 states and 2304 transitions. [2019-12-27 02:38:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:38:04,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 02:38:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:04,920 INFO L225 Difference]: With dead ends: 989 [2019-12-27 02:38:04,921 INFO L226 Difference]: Without dead ends: 989 [2019-12-27 02:38:04,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:38:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-27 02:38:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 780. [2019-12-27 02:38:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 02:38:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1832 transitions. [2019-12-27 02:38:04,938 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1832 transitions. Word has length 55 [2019-12-27 02:38:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:04,938 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1832 transitions. [2019-12-27 02:38:04,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:38:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1832 transitions. [2019-12-27 02:38:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:04,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:04,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:04,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2089737911, now seen corresponding path program 3 times [2019-12-27 02:38:04,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:04,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983160014] [2019-12-27 02:38:04,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:05,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983160014] [2019-12-27 02:38:05,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:05,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:38:05,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562276657] [2019-12-27 02:38:05,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:38:05,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:38:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:38:05,109 INFO L87 Difference]: Start difference. First operand 780 states and 1832 transitions. Second operand 6 states. [2019-12-27 02:38:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:05,461 INFO L93 Difference]: Finished difference Result 1297 states and 3013 transitions. [2019-12-27 02:38:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:38:05,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 02:38:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:05,464 INFO L225 Difference]: With dead ends: 1297 [2019-12-27 02:38:05,464 INFO L226 Difference]: Without dead ends: 1297 [2019-12-27 02:38:05,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:38:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-12-27 02:38:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 840. [2019-12-27 02:38:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-27 02:38:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1982 transitions. [2019-12-27 02:38:05,484 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1982 transitions. Word has length 55 [2019-12-27 02:38:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:05,484 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1982 transitions. [2019-12-27 02:38:05,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:38:05,485 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1982 transitions. [2019-12-27 02:38:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 02:38:05,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:05,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:05,487 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:05,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1513553193, now seen corresponding path program 4 times [2019-12-27 02:38:05,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:05,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819503159] [2019-12-27 02:38:05,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:05,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819503159] [2019-12-27 02:38:05,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:05,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:05,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906425583] [2019-12-27 02:38:05,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:05,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:05,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:05,554 INFO L87 Difference]: Start difference. First operand 840 states and 1982 transitions. Second operand 3 states. [2019-12-27 02:38:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:05,571 INFO L93 Difference]: Finished difference Result 738 states and 1699 transitions. [2019-12-27 02:38:05,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:05,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 02:38:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:05,573 INFO L225 Difference]: With dead ends: 738 [2019-12-27 02:38:05,573 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 02:38:05,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 02:38:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-27 02:38:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-27 02:38:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1699 transitions. [2019-12-27 02:38:05,585 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1699 transitions. Word has length 55 [2019-12-27 02:38:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:05,585 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1699 transitions. [2019-12-27 02:38:05,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1699 transitions. [2019-12-27 02:38:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 02:38:05,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:05,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:05,588 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:05,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:05,588 INFO L82 PathProgramCache]: Analyzing trace with hash -272893927, now seen corresponding path program 1 times [2019-12-27 02:38:05,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:05,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302638977] [2019-12-27 02:38:05,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:05,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302638977] [2019-12-27 02:38:05,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:05,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:38:05,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996992301] [2019-12-27 02:38:05,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:38:05,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:38:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:05,665 INFO L87 Difference]: Start difference. First operand 738 states and 1699 transitions. Second operand 3 states. [2019-12-27 02:38:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:05,706 INFO L93 Difference]: Finished difference Result 738 states and 1698 transitions. [2019-12-27 02:38:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:38:05,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 02:38:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:05,708 INFO L225 Difference]: With dead ends: 738 [2019-12-27 02:38:05,708 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 02:38:05,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:38:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 02:38:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 475. [2019-12-27 02:38:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 02:38:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1087 transitions. [2019-12-27 02:38:05,717 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1087 transitions. Word has length 56 [2019-12-27 02:38:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:05,718 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1087 transitions. [2019-12-27 02:38:05,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:38:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1087 transitions. [2019-12-27 02:38:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:05,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:05,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:05,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash -897693906, now seen corresponding path program 1 times [2019-12-27 02:38:05,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:05,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100237729] [2019-12-27 02:38:05,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100237729] [2019-12-27 02:38:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:38:05,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159428981] [2019-12-27 02:38:05,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:38:05,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:38:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:38:05,853 INFO L87 Difference]: Start difference. First operand 475 states and 1087 transitions. Second operand 6 states. [2019-12-27 02:38:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:05,918 INFO L93 Difference]: Finished difference Result 672 states and 1433 transitions. [2019-12-27 02:38:05,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:38:05,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 02:38:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:05,920 INFO L225 Difference]: With dead ends: 672 [2019-12-27 02:38:05,920 INFO L226 Difference]: Without dead ends: 413 [2019-12-27 02:38:05,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:38:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-27 02:38:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-12-27 02:38:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 02:38:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 908 transitions. [2019-12-27 02:38:05,930 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 908 transitions. Word has length 57 [2019-12-27 02:38:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:05,930 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 908 transitions. [2019-12-27 02:38:05,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:38:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 908 transitions. [2019-12-27 02:38:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:05,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:05,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:05,932 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash 704044892, now seen corresponding path program 2 times [2019-12-27 02:38:05,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:05,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064535958] [2019-12-27 02:38:05,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:06,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064535958] [2019-12-27 02:38:06,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:06,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:38:06,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439125546] [2019-12-27 02:38:06,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:38:06,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:38:06,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:38:06,094 INFO L87 Difference]: Start difference. First operand 413 states and 908 transitions. Second operand 6 states. [2019-12-27 02:38:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:06,181 INFO L93 Difference]: Finished difference Result 648 states and 1360 transitions. [2019-12-27 02:38:06,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:38:06,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 02:38:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:06,183 INFO L225 Difference]: With dead ends: 648 [2019-12-27 02:38:06,183 INFO L226 Difference]: Without dead ends: 233 [2019-12-27 02:38:06,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:38:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-12-27 02:38:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2019-12-27 02:38:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 02:38:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 361 transitions. [2019-12-27 02:38:06,188 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 361 transitions. Word has length 57 [2019-12-27 02:38:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:06,189 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 361 transitions. [2019-12-27 02:38:06,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:38:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 361 transitions. [2019-12-27 02:38:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:06,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:06,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:06,190 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -876750572, now seen corresponding path program 3 times [2019-12-27 02:38:06,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794452963] [2019-12-27 02:38:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:38:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:38:06,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794452963] [2019-12-27 02:38:06,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:38:06,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:38:06,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096321215] [2019-12-27 02:38:06,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:38:06,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:38:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:38:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:38:06,505 INFO L87 Difference]: Start difference. First operand 209 states and 361 transitions. Second operand 15 states. [2019-12-27 02:38:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:38:07,228 INFO L93 Difference]: Finished difference Result 370 states and 622 transitions. [2019-12-27 02:38:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:38:07,229 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 02:38:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:38:07,230 INFO L225 Difference]: With dead ends: 370 [2019-12-27 02:38:07,230 INFO L226 Difference]: Without dead ends: 335 [2019-12-27 02:38:07,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:38:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-27 02:38:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2019-12-27 02:38:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 02:38:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 546 transitions. [2019-12-27 02:38:07,236 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 546 transitions. Word has length 57 [2019-12-27 02:38:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:38:07,236 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 546 transitions. [2019-12-27 02:38:07,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:38:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 546 transitions. [2019-12-27 02:38:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 02:38:07,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:38:07,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:38:07,238 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:38:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:38:07,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1963724718, now seen corresponding path program 4 times [2019-12-27 02:38:07,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:38:07,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809127045] [2019-12-27 02:38:07,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:38:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:38:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:38:07,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:38:07,379 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:38:07,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~y$w_buff0~0_225) (= v_~x~0_72 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_30 0) (= 0 v_~__unbuffered_cnt~0_82) (= v_~y$w_buff1_used~0_382 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_120 0) (= 0 v_~y$r_buff1_thd2~0_163) (= v_~y$r_buff1_thd1~0_106 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25| 1) |v_#valid_62|) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1202~0.base_25| 4)) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~y$r_buff0_thd3~0_195) (= 0 v_~y$r_buff0_thd2~0_108) (= 0 v_~y$flush_delayed~0_58) (= 0 |v_#NULL.base_6|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1202~0.base_25|)) (= v_~z~0_106 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= v_~y$mem_tmp~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_120) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_45 0) (= v_~y~0_155 0) (= 0 v_~y$r_buff1_thd3~0_156) (= v_~y$r_buff0_thd0~0_325 0) (= v_~weak$$choice2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1202~0.base_25|) |v_ULTIMATE.start_main_~#t1202~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd0~0_281 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1202~0.base_25|) (= v_~y$w_buff0_used~0_625 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_22|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_28|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_45|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_45, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_156, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_30, ~y$flush_delayed~0=v_~y$flush_delayed~0_58, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_120, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_25|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_26|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_281, ~x~0=v_~x~0_72, ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_625, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_41|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_67|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_106|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_53|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_106, ULTIMATE.start_main_~#t1202~0.base=|v_ULTIMATE.start_main_~#t1202~0.base_25|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_24|, ~y$w_buff0~0=v_~y$w_buff0~0_225, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_195, ~y~0=v_~y~0_155, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_25|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_28|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_48|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_19|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_163, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_325, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_108, ULTIMATE.start_main_~#t1202~0.offset=|v_ULTIMATE.start_main_~#t1202~0.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1204~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1204~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1202~0.base, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1203~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1203~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1202~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:38:07,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1203~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1203~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1203~0.base_13|) |v_ULTIMATE.start_main_~#t1203~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1203~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1203~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1203~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1203~0.base=|v_ULTIMATE.start_main_~#t1203~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1203~0.offset=|v_ULTIMATE.start_main_~#t1203~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1203~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1203~0.offset] because there is no mapped edge [2019-12-27 02:38:07,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1204~0.base_13|) |v_ULTIMATE.start_main_~#t1204~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1204~0.base_13|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1204~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1204~0.base_13| 4)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1204~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1204~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1204~0.offset=|v_ULTIMATE.start_main_~#t1204~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1204~0.base=|v_ULTIMATE.start_main_~#t1204~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1204~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1204~0.base] because there is no mapped edge [2019-12-27 02:38:07,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= v_~y$w_buff0~0_33 v_~y$w_buff1~0_29) (= v_~y$w_buff0_used~0_130 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_12| v_P2Thread1of1ForFork0_~arg.base_12) (= 0 (mod v_~y$w_buff1_used~0_75 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|) (= 2 v_~y$w_buff0~0_32) (= v_~y$w_buff1_used~0_75 v_~y$w_buff0_used~0_131) (= |v_P2Thread1of1ForFork0_#in~arg.offset_12| v_P2Thread1of1ForFork0_~arg.offset_12)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff0~0=v_~y$w_buff0~0_33, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_12, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_12|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_12|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_32, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_12, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:38:07,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~a~0_29 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~x~0_52 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_29, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_52, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 02:38:07,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1322148204 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1322148204 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1322148204| 0)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out-1322148204| ~y$w_buff0_used~0_In-1322148204) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322148204, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1322148204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1322148204, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1322148204|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1322148204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:38:07,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1645925861 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1645925861 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1645925861 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1645925861 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-1645925861| 0)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1645925861| ~y$w_buff1_used~0_In-1645925861) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1645925861, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1645925861, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1645925861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1645925861} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1645925861, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1645925861, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1645925861|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1645925861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1645925861} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:38:07,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-571518061 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-571518061 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-571518061 ~y$r_buff0_thd3~0_In-571518061)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out-571518061)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-571518061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-571518061} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-571518061, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-571518061, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-571518061|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:38:07,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-605636879 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-605636879 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-605636879 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-605636879 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-605636879| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out-605636879| ~y$r_buff1_thd3~0_In-605636879) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-605636879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-605636879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-605636879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-605636879} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-605636879|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-605636879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-605636879, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-605636879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-605636879} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:38:07,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_28| v_~y$r_buff1_thd3~0_94) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_27|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_94, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 02:38:07,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In75842081 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In75842081 256)))) (or (and (= ~y~0_In75842081 |P1Thread1of1ForFork2_#t~ite3_Out75842081|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In75842081 |P1Thread1of1ForFork2_#t~ite3_Out75842081|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In75842081, ~y$w_buff1~0=~y$w_buff1~0_In75842081, ~y~0=~y~0_In75842081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In75842081} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In75842081, ~y$w_buff1~0=~y$w_buff1~0_In75842081, ~y~0=~y~0_In75842081, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out75842081|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In75842081} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:38:07,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_39 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_9|, ~y~0=v_~y~0_39, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:38:07,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1333608685 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1333608685 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite5_Out1333608685| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1333608685 |P1Thread1of1ForFork2_#t~ite5_Out1333608685|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1333608685, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1333608685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1333608685, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1333608685, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1333608685|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:38:07,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In509358780 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In509358780 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In509358780 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In509358780 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out509358780|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out509358780| ~y$w_buff1_used~0_In509358780)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In509358780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In509358780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In509358780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In509358780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In509358780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In509358780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In509358780, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out509358780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In509358780} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:38:07,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-712319216 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-712319216 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-712319216| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-712319216| ~y$r_buff0_thd2~0_In-712319216)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-712319216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-712319216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-712319216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-712319216, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-712319216|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:38:07,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-11906667 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-11906667 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-11906667 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-11906667 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-11906667 |P1Thread1of1ForFork2_#t~ite8_Out-11906667|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-11906667|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-11906667, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-11906667, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-11906667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-11906667} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-11906667, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-11906667, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-11906667|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-11906667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-11906667} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:38:07,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork2_#t~ite8_30| v_~y$r_buff1_thd2~0_111) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:38:07,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:38:07,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite19_Out704255829| |ULTIMATE.start_main_#t~ite18_Out704255829|)) (.cse1 (= (mod ~y$w_buff1_used~0_In704255829 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In704255829 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite18_Out704255829| ~y~0_In704255829)) (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite18_Out704255829| ~y$w_buff1~0_In704255829)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In704255829, ~y~0=~y~0_In704255829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In704255829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In704255829} OutVars{~y$w_buff1~0=~y$w_buff1~0_In704255829, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out704255829|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out704255829|, ~y~0=~y~0_In704255829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In704255829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In704255829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:38:07,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1076071323 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1076071323 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-1076071323| ~y$w_buff0_used~0_In-1076071323) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1076071323|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1076071323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1076071323} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1076071323, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1076071323, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1076071323|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:38:07,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1944465211 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1944465211 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1944465211 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1944465211 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out1944465211| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1944465211 |ULTIMATE.start_main_#t~ite21_Out1944465211|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1944465211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944465211, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1944465211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1944465211} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1944465211, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944465211, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1944465211|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1944465211, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1944465211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:38:07,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-263961971 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-263961971 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-263961971| ~y$r_buff0_thd0~0_In-263961971) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-263961971|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-263961971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-263961971} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-263961971, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-263961971, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-263961971|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:38:07,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1524231738 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1524231738 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1524231738 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1524231738 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1524231738|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1524231738 |ULTIMATE.start_main_#t~ite23_Out1524231738|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1524231738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1524231738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1524231738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1524231738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1524231738, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1524231738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1524231738, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1524231738|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1524231738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 02:38:07,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In772751907 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In772751907 |ULTIMATE.start_main_#t~ite33_Out772751907|) (= |ULTIMATE.start_main_#t~ite32_In772751907| |ULTIMATE.start_main_#t~ite32_Out772751907|)) (and (= |ULTIMATE.start_main_#t~ite33_Out772751907| |ULTIMATE.start_main_#t~ite32_Out772751907|) (= ~y$w_buff1~0_In772751907 |ULTIMATE.start_main_#t~ite32_Out772751907|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In772751907 256) 0))) (or (= (mod ~y$w_buff0_used~0_In772751907 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In772751907 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In772751907 256) 0)))) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In772751907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In772751907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In772751907, ~weak$$choice2~0=~weak$$choice2~0_In772751907, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In772751907, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In772751907|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In772751907} OutVars{~y$w_buff1~0=~y$w_buff1~0_In772751907, ~y$w_buff0_used~0=~y$w_buff0_used~0_In772751907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In772751907, ~weak$$choice2~0=~weak$$choice2~0_In772751907, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out772751907|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In772751907, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out772751907|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In772751907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 02:38:07,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L834-->L834-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2139144793 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-2139144793| |ULTIMATE.start_main_#t~ite36_Out-2139144793|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2139144793 256)))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In-2139144793 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In-2139144793 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2139144793 256)))) (= |ULTIMATE.start_main_#t~ite35_Out-2139144793| ~y$w_buff0_used~0_In-2139144793)) (and (= |ULTIMATE.start_main_#t~ite35_In-2139144793| |ULTIMATE.start_main_#t~ite35_Out-2139144793|) (= ~y$w_buff0_used~0_In-2139144793 |ULTIMATE.start_main_#t~ite36_Out-2139144793|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139144793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139144793, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-2139144793|, ~weak$$choice2~0=~weak$$choice2~0_In-2139144793, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2139144793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139144793} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139144793, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2139144793, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2139144793|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2139144793|, ~weak$$choice2~0=~weak$$choice2~0_In-2139144793, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2139144793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2139144793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:38:07,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In518366000 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_In518366000| |ULTIMATE.start_main_#t~ite38_Out518366000|) (= ~y$w_buff1_used~0_In518366000 |ULTIMATE.start_main_#t~ite39_Out518366000|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out518366000| |ULTIMATE.start_main_#t~ite38_Out518366000|) .cse0 (= ~y$w_buff1_used~0_In518366000 |ULTIMATE.start_main_#t~ite38_Out518366000|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In518366000 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In518366000 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In518366000 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In518366000 256)))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In518366000, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In518366000, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In518366000|, ~weak$$choice2~0=~weak$$choice2~0_In518366000, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In518366000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In518366000} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In518366000, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out518366000|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In518366000, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out518366000|, ~weak$$choice2~0=~weak$$choice2~0_In518366000, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In518366000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In518366000} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:38:07,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~y$r_buff0_thd0~0_100 v_~y$r_buff0_thd0~0_99)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:38:07,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L839-->L4: Formula: (and (= v_~y~0_138 v_~y$mem_tmp~0_17) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~y$flush_delayed~0_52) (not (= (mod v_~y$flush_delayed~0_53 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_52, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~y~0=v_~y~0_138, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:38:07,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:38:07,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:38:07 BasicIcfg [2019-12-27 02:38:07,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:38:07,512 INFO L168 Benchmark]: Toolchain (without parser) took 17203.89 ms. Allocated memory was 146.8 MB in the beginning and 752.9 MB in the end (delta: 606.1 MB). Free memory was 103.5 MB in the beginning and 474.3 MB in the end (delta: -370.9 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,513 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:38:07,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.53 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 158.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.22 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,515 INFO L168 Benchmark]: Boogie Preprocessor took 63.73 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,516 INFO L168 Benchmark]: RCFGBuilder took 805.83 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,516 INFO L168 Benchmark]: TraceAbstraction took 15425.88 ms. Allocated memory was 204.5 MB in the beginning and 752.9 MB in the end (delta: 548.4 MB). Free memory was 105.7 MB in the beginning and 474.3 MB in the end (delta: -368.6 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:38:07,520 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.53 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 158.0 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.22 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.73 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.83 ms. Allocated memory is still 204.5 MB. Free memory was 152.3 MB in the beginning and 105.7 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15425.88 ms. Allocated memory was 204.5 MB in the beginning and 752.9 MB in the end (delta: 548.4 MB). Free memory was 105.7 MB in the beginning and 474.3 MB in the end (delta: -368.6 MB). Peak memory consumption was 179.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 26 ChoiceCompositions, 4376 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 58 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46792 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1468 SDtfs, 1188 SDslu, 2966 SDs, 0 SdLazy, 1471 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22284occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 3326 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 107213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...