/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:19:32,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:19:32,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:19:32,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:19:32,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:19:32,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:19:32,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:19:32,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:19:32,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:19:32,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:19:32,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:19:32,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:19:32,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:19:32,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:19:32,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:19:32,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:19:32,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:19:32,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:19:32,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:19:32,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:19:32,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:19:32,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:19:32,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:19:32,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:19:32,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:19:32,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:19:32,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:19:32,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:19:32,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:19:32,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:19:32,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:19:32,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:19:32,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:19:32,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:19:32,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:19:32,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:19:32,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:19:32,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:19:32,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:19:32,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:19:32,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:19:32,415 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-VariableLbe.epf [2019-12-18 20:19:32,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:19:32,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:19:32,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:19:32,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:19:32,451 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:19:32,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:19:32,451 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:19:32,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:19:32,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:19:32,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:19:32,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:19:32,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:19:32,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:19:32,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:19:32,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:19:32,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:19:32,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:19:32,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:19:32,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:19:32,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:19:32,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:19:32,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:19:32,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:19:32,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:19:32,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:19:32,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:19:32,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:19:32,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:19:32,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:19:32,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:19:32,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:19:32,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:19:32,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:19:32,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:19:32,787 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:19:32,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-18 20:19:32,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3ba045e/155878955fa14c18882fa71d2e1fa8f8/FLAGef5f76198 [2019-12-18 20:19:33,399 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:19:33,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-18 20:19:33,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3ba045e/155878955fa14c18882fa71d2e1fa8f8/FLAGef5f76198 [2019-12-18 20:19:33,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d3ba045e/155878955fa14c18882fa71d2e1fa8f8 [2019-12-18 20:19:33,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:19:33,632 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:19:33,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:33,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:19:33,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:19:33,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:33" (1/1) ... [2019-12-18 20:19:33,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eec06f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:33, skipping insertion in model container [2019-12-18 20:19:33,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:33" (1/1) ... [2019-12-18 20:19:33,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:19:33,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:19:34,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:34,231 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:19:34,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:34,370 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:19:34,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34 WrapperNode [2019-12-18 20:19:34,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:34,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:34,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:19:34,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:19:34,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:34,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:19:34,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:19:34,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:19:34,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (1/1) ... [2019-12-18 20:19:34,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:19:34,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:19:34,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:19:34,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:19:34,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (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-18 20:19:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:19:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:19:34,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:19:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:19:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:19:34,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:19:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:19:34,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:19:34,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:19:34,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:19:34,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:19:34,539 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:19:35,260 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:19:35,260 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:19:35,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:35 BoogieIcfgContainer [2019-12-18 20:19:35,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:19:35,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:19:35,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:19:35,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:19:35,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:19:33" (1/3) ... [2019-12-18 20:19:35,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7541ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:35, skipping insertion in model container [2019-12-18 20:19:35,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:34" (2/3) ... [2019-12-18 20:19:35,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7541ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:35, skipping insertion in model container [2019-12-18 20:19:35,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:35" (3/3) ... [2019-12-18 20:19:35,271 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-18 20:19:35,282 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:19:35,282 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:19:35,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:19:35,298 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:19:35,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,360 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,361 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,428 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,435 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,437 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:35,455 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:19:35,476 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:19:35,476 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:19:35,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:19:35,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:19:35,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:19:35,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:19:35,477 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:19:35,477 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:19:35,494 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 20:19:35,496 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:35,573 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:35,574 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:35,589 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:35,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 20:19:35,669 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 20:19:35,670 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:35,680 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:19:35,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:19:35,704 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:19:38,991 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 20:19:39,103 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 20:19:39,132 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-18 20:19:39,133 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-18 20:19:39,136 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 20:19:39,567 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-18 20:19:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-18 20:19:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:19:39,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:39,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:19:39,577 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-18 20:19:39,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:39,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188167750] [2019-12-18 20:19:39,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:39,832 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-18 20:19:39,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188167750] [2019-12-18 20:19:39,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:39,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:39,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552901677] [2019-12-18 20:19:39,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:39,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:39,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:39,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:39,864 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-18 20:19:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:40,068 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-18 20:19:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:40,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:19:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:40,188 INFO L225 Difference]: With dead ends: 8205 [2019-12-18 20:19:40,188 INFO L226 Difference]: Without dead ends: 7724 [2019-12-18 20:19:40,189 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-18 20:19:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-18 20:19:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-18 20:19:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-18 20:19:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-18 20:19:40,644 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-18 20:19:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:40,644 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-18 20:19:40,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-18 20:19:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:19:40,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:40,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:40,649 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-18 20:19:40,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:40,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555417392] [2019-12-18 20:19:40,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:40,715 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-18 20:19:40,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555417392] [2019-12-18 20:19:40,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:40,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:40,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211859007] [2019-12-18 20:19:40,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:40,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:40,719 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-18 20:19:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:40,751 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-18 20:19:40,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:40,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 20:19:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:40,758 INFO L225 Difference]: With dead ends: 1230 [2019-12-18 20:19:40,758 INFO L226 Difference]: Without dead ends: 1230 [2019-12-18 20:19:40,759 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-18 20:19:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-18 20:19:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-18 20:19:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-18 20:19:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-18 20:19:40,789 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-18 20:19:40,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:40,789 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-18 20:19:40,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-18 20:19:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:19:40,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:40,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:40,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:40,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-18 20:19:40,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:40,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2749498] [2019-12-18 20:19:40,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:40,920 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-18 20:19:40,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2749498] [2019-12-18 20:19:40,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:40,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:40,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148857168] [2019-12-18 20:19:40,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:40,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:40,922 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-18 20:19:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:41,235 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-18 20:19:41,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:19:41,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:19:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:41,246 INFO L225 Difference]: With dead ends: 1827 [2019-12-18 20:19:41,246 INFO L226 Difference]: Without dead ends: 1827 [2019-12-18 20:19:41,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-18 20:19:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-18 20:19:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-18 20:19:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-18 20:19:41,292 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-18 20:19:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:41,293 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-18 20:19:41,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-18 20:19:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:19:41,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:41,296 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] [2019-12-18 20:19:41,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-18 20:19:41,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:41,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357494596] [2019-12-18 20:19:41,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:41,395 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-18 20:19:41,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357494596] [2019-12-18 20:19:41,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:41,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:19:41,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13932444] [2019-12-18 20:19:41,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:19:41,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:19:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:19:41,397 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-18 20:19:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:41,866 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-18 20:19:41,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:19:41,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:19:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:41,878 INFO L225 Difference]: With dead ends: 2335 [2019-12-18 20:19:41,879 INFO L226 Difference]: Without dead ends: 2335 [2019-12-18 20:19:41,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-18 20:19:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-18 20:19:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-18 20:19:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-18 20:19:41,931 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-18 20:19:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:41,932 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-18 20:19:41,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:19:41,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-18 20:19:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:19:41,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:41,935 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-18 20:19:41,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:41,936 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-18 20:19:41,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:41,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542130943] [2019-12-18 20:19:41,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:42,045 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-18 20:19:42,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542130943] [2019-12-18 20:19:42,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:42,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:42,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108440304] [2019-12-18 20:19:42,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:42,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:42,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:42,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:42,048 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-18 20:19:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:42,063 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-18 20:19:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:42,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:19:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:42,076 INFO L225 Difference]: With dead ends: 1702 [2019-12-18 20:19:42,076 INFO L226 Difference]: Without dead ends: 1702 [2019-12-18 20:19:42,076 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-18 20:19:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-18 20:19:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-18 20:19:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-18 20:19:42,130 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-18 20:19:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:42,131 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-18 20:19:42,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-18 20:19:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:42,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:42,136 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] [2019-12-18 20:19:42,136 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-18 20:19:42,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:42,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881028584] [2019-12-18 20:19:42,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:42,252 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-18 20:19:42,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881028584] [2019-12-18 20:19:42,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:42,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:42,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636812371] [2019-12-18 20:19:42,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:42,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:42,254 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-18 20:19:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:42,287 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-18 20:19:42,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:42,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 20:19:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:42,305 INFO L225 Difference]: With dead ends: 2698 [2019-12-18 20:19:42,305 INFO L226 Difference]: Without dead ends: 1248 [2019-12-18 20:19:42,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-18 20:19:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-18 20:19:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-18 20:19:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-18 20:19:42,339 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-18 20:19:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:42,339 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-18 20:19:42,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-18 20:19:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:19:42,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:42,341 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] [2019-12-18 20:19:42,341 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:42,342 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-18 20:19:42,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:42,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422332783] [2019-12-18 20:19:42,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:42,442 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-18 20:19:42,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422332783] [2019-12-18 20:19:42,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:42,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:19:42,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639686447] [2019-12-18 20:19:42,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:19:42,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:42,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:19:42,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:19:42,445 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 5 states. [2019-12-18 20:19:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:42,956 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-18 20:19:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:19:42,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:19:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:42,962 INFO L225 Difference]: With dead ends: 1897 [2019-12-18 20:19:42,963 INFO L226 Difference]: Without dead ends: 1897 [2019-12-18 20:19:42,963 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-18 20:19:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-18 20:19:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-18 20:19:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-18 20:19:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-18 20:19:43,001 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-18 20:19:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:43,002 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-18 20:19:43,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:19:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-18 20:19:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:19:43,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:43,005 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] [2019-12-18 20:19:43,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-18 20:19:43,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:43,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620695003] [2019-12-18 20:19:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:43,059 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-18 20:19:43,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620695003] [2019-12-18 20:19:43,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:43,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:43,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316497520] [2019-12-18 20:19:43,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:43,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:43,061 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 4 states. [2019-12-18 20:19:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:43,077 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-18 20:19:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:19:43,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 20:19:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:43,080 INFO L225 Difference]: With dead ends: 921 [2019-12-18 20:19:43,081 INFO L226 Difference]: Without dead ends: 824 [2019-12-18 20:19:43,081 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-18 20:19:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-18 20:19:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-18 20:19:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 20:19:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-18 20:19:43,097 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-18 20:19:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:43,098 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-18 20:19:43,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:19:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-18 20:19:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:43,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:43,101 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] [2019-12-18 20:19:43,101 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-18 20:19:43,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:43,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756066831] [2019-12-18 20:19:43,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:43,191 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-18 20:19:43,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756066831] [2019-12-18 20:19:43,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:43,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:19:43,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887848323] [2019-12-18 20:19:43,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:43,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:43,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:43,194 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-18 20:19:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:43,474 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-18 20:19:43,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:19:43,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:43,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:43,481 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 20:19:43,481 INFO L226 Difference]: Without dead ends: 903 [2019-12-18 20:19:43,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:19:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-18 20:19:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-18 20:19:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 20:19:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-18 20:19:43,515 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-18 20:19:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:43,515 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-18 20:19:43,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-18 20:19:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:43,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:43,523 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] [2019-12-18 20:19:43,523 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-18 20:19:43,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:43,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430405574] [2019-12-18 20:19:43,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:43,695 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-18 20:19:43,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430405574] [2019-12-18 20:19:43,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:43,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:19:43,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028121986] [2019-12-18 20:19:43,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:19:43,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:19:43,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:19:43,697 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-18 20:19:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:44,275 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-18 20:19:44,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:19:44,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:19:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:44,281 INFO L225 Difference]: With dead ends: 1033 [2019-12-18 20:19:44,281 INFO L226 Difference]: Without dead ends: 1033 [2019-12-18 20:19:44,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-18 20:19:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 833. [2019-12-18 20:19:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-18 20:19:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1740 transitions. [2019-12-18 20:19:44,305 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1740 transitions. Word has length 51 [2019-12-18 20:19:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:44,305 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1740 transitions. [2019-12-18 20:19:44,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:19:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1740 transitions. [2019-12-18 20:19:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:19:44,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:44,308 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] [2019-12-18 20:19:44,308 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-18 20:19:44,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:44,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364462224] [2019-12-18 20:19:44,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:44,470 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-18 20:19:44,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364462224] [2019-12-18 20:19:44,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:44,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:44,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664224578] [2019-12-18 20:19:44,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:44,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:44,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:44,472 INFO L87 Difference]: Start difference. First operand 833 states and 1740 transitions. Second operand 3 states. [2019-12-18 20:19:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:44,529 INFO L93 Difference]: Finished difference Result 1106 states and 2316 transitions. [2019-12-18 20:19:44,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:44,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:19:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:44,533 INFO L225 Difference]: With dead ends: 1106 [2019-12-18 20:19:44,533 INFO L226 Difference]: Without dead ends: 1106 [2019-12-18 20:19:44,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:44,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-18 20:19:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-12-18 20:19:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-18 20:19:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1876 transitions. [2019-12-18 20:19:44,553 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1876 transitions. Word has length 51 [2019-12-18 20:19:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:44,554 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1876 transitions. [2019-12-18 20:19:44,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1876 transitions. [2019-12-18 20:19:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:44,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:44,558 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] [2019-12-18 20:19:44,558 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-18 20:19:44,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:44,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506471544] [2019-12-18 20:19:44,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:44,780 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-18 20:19:44,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506471544] [2019-12-18 20:19:44,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:44,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:19:44,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977898801] [2019-12-18 20:19:44,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:19:44,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:44,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:19:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:19:44,783 INFO L87 Difference]: Start difference. First operand 890 states and 1876 transitions. Second operand 10 states. [2019-12-18 20:19:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:45,787 INFO L93 Difference]: Finished difference Result 1371 states and 2812 transitions. [2019-12-18 20:19:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:19:45,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-18 20:19:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:45,792 INFO L225 Difference]: With dead ends: 1371 [2019-12-18 20:19:45,792 INFO L226 Difference]: Without dead ends: 1371 [2019-12-18 20:19:45,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:19:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-18 20:19:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 962. [2019-12-18 20:19:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-18 20:19:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2025 transitions. [2019-12-18 20:19:45,815 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2025 transitions. Word has length 52 [2019-12-18 20:19:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:45,815 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2025 transitions. [2019-12-18 20:19:45,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:19:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2025 transitions. [2019-12-18 20:19:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:45,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:45,819 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] [2019-12-18 20:19:45,819 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-18 20:19:45,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:45,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508581388] [2019-12-18 20:19:45,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:45,878 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-18 20:19:45,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508581388] [2019-12-18 20:19:45,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:45,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:19:45,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473067644] [2019-12-18 20:19:45,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:45,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:45,880 INFO L87 Difference]: Start difference. First operand 962 states and 2025 transitions. Second operand 3 states. [2019-12-18 20:19:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:45,919 INFO L93 Difference]: Finished difference Result 1335 states and 2700 transitions. [2019-12-18 20:19:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:45,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:19:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:45,923 INFO L225 Difference]: With dead ends: 1335 [2019-12-18 20:19:45,923 INFO L226 Difference]: Without dead ends: 1335 [2019-12-18 20:19:45,924 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-18 20:19:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-12-18 20:19:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1048. [2019-12-18 20:19:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-18 20:19:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2176 transitions. [2019-12-18 20:19:45,986 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2176 transitions. Word has length 52 [2019-12-18 20:19:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:45,987 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2176 transitions. [2019-12-18 20:19:45,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2176 transitions. [2019-12-18 20:19:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:19:45,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:45,990 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] [2019-12-18 20:19:45,990 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-18 20:19:45,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:45,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404541250] [2019-12-18 20:19:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:46,065 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-18 20:19:46,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404541250] [2019-12-18 20:19:46,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:46,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:46,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628928670] [2019-12-18 20:19:46,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:46,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:46,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:46,068 INFO L87 Difference]: Start difference. First operand 1048 states and 2176 transitions. Second operand 3 states. [2019-12-18 20:19:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:46,087 INFO L93 Difference]: Finished difference Result 1047 states and 2174 transitions. [2019-12-18 20:19:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:46,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:19:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:46,090 INFO L225 Difference]: With dead ends: 1047 [2019-12-18 20:19:46,090 INFO L226 Difference]: Without dead ends: 1047 [2019-12-18 20:19:46,090 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-18 20:19:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-12-18 20:19:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 823. [2019-12-18 20:19:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-18 20:19:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-18 20:19:46,114 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-18 20:19:46,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:46,115 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-18 20:19:46,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-18 20:19:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:19:46,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:46,117 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] [2019-12-18 20:19:46,118 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-18 20:19:46,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:46,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925196644] [2019-12-18 20:19:46,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:19:46,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:19:46,291 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:19:46,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_22|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 v_~__unbuffered_cnt~0_17) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_22|)) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_22| 4) |v_#length_17|) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_22| 1)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~weak$$choice0~0_6) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_17|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_22|) |v_ULTIMATE.start_main_~#t315~0.offset_17| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_17|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_24|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:19:46,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-18 20:19:46,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff0_thd1~0_In2027612129 ~y$r_buff1_thd1~0_Out2027612129) (= ~y$r_buff1_thd0~0_Out2027612129 ~y$r_buff0_thd0~0_In2027612129) (= ~y$r_buff0_thd2~0_In2027612129 ~y$r_buff1_thd2~0_Out2027612129) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2027612129)) (= ~x~0_In2027612129 ~__unbuffered_p0_EAX~0_Out2027612129) (= 1 ~y$r_buff0_thd1~0_Out2027612129)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2027612129, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2027612129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2027612129, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2027612129, ~x~0=~x~0_In2027612129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2027612129, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2027612129, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2027612129, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2027612129, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2027612129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2027612129, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2027612129, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2027612129, ~x~0=~x~0_In2027612129} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:19:46,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-746380217 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-746380217 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-746380217| ~y$w_buff0_used~0_In-746380217) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-746380217|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-746380217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746380217} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-746380217|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-746380217, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-746380217} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:19:46,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In797037317 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In797037317 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In797037317 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In797037317 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In797037317 |P0Thread1of1ForFork0_#t~ite6_Out797037317|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out797037317|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In797037317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In797037317, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In797037317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In797037317} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out797037317|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In797037317, ~y$w_buff0_used~0=~y$w_buff0_used~0_In797037317, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In797037317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In797037317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:19:46,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1568172535 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1568172535 256) 0))) (or (and (= ~y$r_buff0_thd1~0_In-1568172535 ~y$r_buff0_thd1~0_Out-1568172535) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1568172535) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1568172535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1568172535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1568172535, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1568172535|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1568172535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:19:46,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In897764431 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In897764431 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In897764431 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In897764431 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out897764431| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out897764431| ~y$r_buff1_thd1~0_In897764431) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In897764431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In897764431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In897764431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897764431} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In897764431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In897764431, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out897764431|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In897764431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In897764431} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:19:46,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:19:46,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2048320048 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out2048320048| |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) (= ~y$w_buff1~0_In2048320048 |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2048320048 256)))) (or (= (mod ~y$w_buff0_used~0_In2048320048 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2048320048 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In2048320048 256) 0)))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite18_Out2048320048| ~y$w_buff1~0_In2048320048) (= |P1Thread1of1ForFork1_#t~ite17_In2048320048| |P1Thread1of1ForFork1_#t~ite17_Out2048320048|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048320048, ~y$w_buff1~0=~y$w_buff1~0_In2048320048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048320048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048320048, ~weak$$choice2~0=~weak$$choice2~0_In2048320048, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In2048320048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048320048} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048320048, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out2048320048|, ~y$w_buff1~0=~y$w_buff1~0_In2048320048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048320048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048320048, ~weak$$choice2~0=~weak$$choice2~0_In2048320048, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out2048320048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048320048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:19:46,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-855734853 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-855734853| ~y$w_buff0_used~0_In-855734853) (= |P1Thread1of1ForFork1_#t~ite20_Out-855734853| |P1Thread1of1ForFork1_#t~ite21_Out-855734853|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-855734853 256)))) (or (= (mod ~y$w_buff0_used~0_In-855734853 256) 0) (and (= (mod ~y$w_buff1_used~0_In-855734853 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-855734853 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-855734853| ~y$w_buff0_used~0_In-855734853) (= |P1Thread1of1ForFork1_#t~ite20_In-855734853| |P1Thread1of1ForFork1_#t~ite20_Out-855734853|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-855734853, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-855734853, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-855734853|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-855734853, ~weak$$choice2~0=~weak$$choice2~0_In-855734853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-855734853} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-855734853, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-855734853, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-855734853|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-855734853, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-855734853|, ~weak$$choice2~0=~weak$$choice2~0_In-855734853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-855734853} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:19:46,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out878924997| |P1Thread1of1ForFork1_#t~ite23_Out878924997|)) (.cse1 (= (mod ~weak$$choice2~0_In878924997 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In878924997 256))) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In878924997 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In878924997 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In878924997 256)))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (or (not .cse2) .cse3) (or (not .cse4) .cse3) (= |P1Thread1of1ForFork1_#t~ite22_Out878924997| 0) (= |P1Thread1of1ForFork1_#t~ite22_Out878924997| |P1Thread1of1ForFork1_#t~ite23_Out878924997|) (not .cse5))) (and (or (and (= ~y$w_buff1_used~0_In878924997 |P1Thread1of1ForFork1_#t~ite24_Out878924997|) (= |P1Thread1of1ForFork1_#t~ite23_In878924997| |P1Thread1of1ForFork1_#t~ite23_Out878924997|) (not .cse1)) (and .cse0 .cse1 (= ~y$w_buff1_used~0_In878924997 |P1Thread1of1ForFork1_#t~ite23_Out878924997|) (or (and .cse4 .cse6) .cse5 (and .cse2 .cse6)))) (= |P1Thread1of1ForFork1_#t~ite22_In878924997| |P1Thread1of1ForFork1_#t~ite22_Out878924997|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In878924997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878924997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In878924997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In878924997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In878924997|, ~weak$$choice2~0=~weak$$choice2~0_In878924997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878924997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In878924997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878924997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In878924997, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out878924997|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out878924997|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out878924997|, ~weak$$choice2~0=~weak$$choice2~0_In878924997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878924997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 20:19:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 20:19:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-787899414 256)))) (or (let ((.cse0 (not (= 0 (mod ~y$r_buff0_thd2~0_In-787899414 256))))) (and (or (not (= 0 (mod ~y$w_buff1_used~0_In-787899414 256))) .cse0) (or .cse0 (not (= 0 (mod ~y$r_buff1_thd2~0_In-787899414 256)))) (not (= 0 (mod ~y$w_buff0_used~0_In-787899414 256))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-787899414|) (= |P1Thread1of1ForFork1_#t~ite29_Out-787899414| |P1Thread1of1ForFork1_#t~ite28_Out-787899414|) .cse1 (= |P1Thread1of1ForFork1_#t~ite30_Out-787899414| |P1Thread1of1ForFork1_#t~ite29_Out-787899414|))) (and (= |P1Thread1of1ForFork1_#t~ite29_In-787899414| |P1Thread1of1ForFork1_#t~ite29_Out-787899414|) (= |P1Thread1of1ForFork1_#t~ite30_Out-787899414| ~y$r_buff1_thd2~0_In-787899414) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_In-787899414| |P1Thread1of1ForFork1_#t~ite28_Out-787899414|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-787899414, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-787899414|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-787899414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-787899414, ~weak$$choice2~0=~weak$$choice2~0_In-787899414, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-787899414|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-787899414} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-787899414, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-787899414|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-787899414|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-787899414, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-787899414, ~weak$$choice2~0=~weak$$choice2~0_In-787899414, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-787899414|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-787899414} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:19:46,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:19:46,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-1343673774| |P1Thread1of1ForFork1_#t~ite32_Out-1343673774|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1343673774 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1343673774 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-1343673774| ~y$w_buff1~0_In-1343673774)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1343673774| ~y~0_In-1343673774) .cse1 (or .cse2 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1343673774, ~y$w_buff1~0=~y$w_buff1~0_In-1343673774, ~y~0=~y~0_In-1343673774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1343673774} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1343673774, ~y$w_buff1~0=~y$w_buff1~0_In-1343673774, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1343673774|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1343673774|, ~y~0=~y~0_In-1343673774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1343673774} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 20:19:46,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In220547292 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In220547292 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In220547292 |P1Thread1of1ForFork1_#t~ite34_Out220547292|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out220547292|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In220547292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In220547292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In220547292, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In220547292, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out220547292|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:19:46,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In343780075 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In343780075 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In343780075 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In343780075 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out343780075|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In343780075 |P1Thread1of1ForFork1_#t~ite35_Out343780075|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343780075, ~y$w_buff0_used~0=~y$w_buff0_used~0_In343780075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In343780075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343780075} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In343780075, ~y$w_buff0_used~0=~y$w_buff0_used~0_In343780075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In343780075, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out343780075|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In343780075} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:19:46,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1190000522 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1190000522 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1190000522| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1190000522 |P1Thread1of1ForFork1_#t~ite36_Out1190000522|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1190000522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1190000522} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1190000522, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1190000522, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1190000522|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:19:46,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-307079365 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-307079365 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-307079365 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-307079365 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-307079365 |P1Thread1of1ForFork1_#t~ite37_Out-307079365|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-307079365|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-307079365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-307079365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-307079365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-307079365} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-307079365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-307079365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-307079365, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-307079365|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-307079365} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:46,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:19:46,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:19:46,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1517987238 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1517987238 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1517987238| ~y~0_In-1517987238)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1517987238| ~y$w_buff1~0_In-1517987238) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1517987238, ~y~0=~y~0_In-1517987238, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1517987238, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1517987238} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1517987238|, ~y$w_buff1~0=~y$w_buff1~0_In-1517987238, ~y~0=~y~0_In-1517987238, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1517987238, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1517987238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:19:46,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 20:19:46,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2025051322 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2025051322 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2025051322|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2025051322 |ULTIMATE.start_main_#t~ite42_Out-2025051322|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2025051322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2025051322} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2025051322, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2025051322, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2025051322|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:19:46,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In581022445 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In581022445 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In581022445 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In581022445 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out581022445|)) (and (= ~y$w_buff1_used~0_In581022445 |ULTIMATE.start_main_#t~ite43_Out581022445|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In581022445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In581022445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In581022445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In581022445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In581022445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In581022445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out581022445|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In581022445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In581022445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:19:46,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1070924278 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1070924278 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1070924278|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1070924278 |ULTIMATE.start_main_#t~ite44_Out-1070924278|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1070924278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1070924278} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1070924278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1070924278, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1070924278|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:19:46,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1719828815 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1719828815 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1719828815 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1719828815 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1719828815| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1719828815| ~y$r_buff1_thd0~0_In1719828815)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1719828815, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1719828815, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1719828815, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1719828815} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1719828815, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1719828815, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1719828815, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1719828815|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1719828815} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:19:46,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:19:46,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:19:46 BasicIcfg [2019-12-18 20:19:46,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:19:46,415 INFO L168 Benchmark]: Toolchain (without parser) took 12784.35 ms. Allocated memory was 145.8 MB in the beginning and 390.6 MB in the end (delta: 244.8 MB). Free memory was 100.9 MB in the beginning and 256.5 MB in the end (delta: -155.6 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,416 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.08 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 100.5 MB in the beginning and 159.6 MB in the end (delta: -59.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.15 ms. Allocated memory is still 205.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,418 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,419 INFO L168 Benchmark]: RCFGBuilder took 784.24 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,420 INFO L168 Benchmark]: TraceAbstraction took 11150.45 ms. Allocated memory was 205.5 MB in the beginning and 390.6 MB in the end (delta: 185.1 MB). Free memory was 110.3 MB in the beginning and 256.5 MB in the end (delta: -146.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:19:46,429 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.45 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 739.08 ms. Allocated memory was 145.8 MB in the beginning and 205.5 MB in the end (delta: 59.8 MB). Free memory was 100.5 MB in the beginning and 159.6 MB in the end (delta: -59.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.15 ms. Allocated memory is still 205.5 MB. Free memory was 159.6 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.24 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11150.45 ms. Allocated memory was 205.5 MB in the beginning and 390.6 MB in the end (delta: 185.1 MB). Free memory was 110.3 MB in the beginning and 256.5 MB in the end (delta: -146.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1682 SDtfs, 1445 SDslu, 3186 SDs, 0 SdLazy, 2399 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 2609 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 65248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...