/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:33:30,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:33:30,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:33:30,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:33:30,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:33:30,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:33:30,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:33:30,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:33:30,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:33:30,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:33:30,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:33:30,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:33:30,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:33:30,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:33:30,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:33:30,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:33:30,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:33:30,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:33:30,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:33:30,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:33:30,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:33:30,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:33:30,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:33:30,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:33:30,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:33:30,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:33:30,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:33:30,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:33:30,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:33:30,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:33:30,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:33:30,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:33:30,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:33:30,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:33:30,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:33:30,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:33:30,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:33:30,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:33:30,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:33:30,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:33:30,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:33:30,513 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-MCR.epf [2019-12-27 22:33:30,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:33:30,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:33:30,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:33:30,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:33:30,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:33:30,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:33:30,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:33:30,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:33:30,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:33:30,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:33:30,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:33:30,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:33:30,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:33:30,542 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:33:30,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:33:30,543 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:33:30,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:33:30,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:33:30,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:33:30,544 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:33:30,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:33:30,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:30,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:33:30,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:33:30,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:33:30,545 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:33:30,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:33:30,545 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:33:30,546 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:33:30,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:33:30,547 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:33:30,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:33:30,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:33:30,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:33:30,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:33:30,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:33:30,852 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:33:30,853 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2019-12-27 22:33:30,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3abd47/9a09a6fe922f4a68b8e8347e6a59f109/FLAG1c0929daf [2019-12-27 22:33:31,425 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:33:31,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_rmo.opt.i [2019-12-27 22:33:31,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3abd47/9a09a6fe922f4a68b8e8347e6a59f109/FLAG1c0929daf [2019-12-27 22:33:31,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8e3abd47/9a09a6fe922f4a68b8e8347e6a59f109 [2019-12-27 22:33:31,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:33:31,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:33:31,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:31,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:33:31,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:33:31,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:31" (1/1) ... [2019-12-27 22:33:31,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e06cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:31, skipping insertion in model container [2019-12-27 22:33:31,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:31" (1/1) ... [2019-12-27 22:33:31,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:33:31,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:33:32,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:32,449 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:33:32,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:32,639 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:33:32,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32 WrapperNode [2019-12-27 22:33:32,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:32,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:32,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:33:32,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:33:32,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:32,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:33:32,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:33:32,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:33:32,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... [2019-12-27 22:33:32,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:33:32,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:33:32,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:33:32,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:33:32,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:33:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:33:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:33:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:33:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:33:32,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:33:32,830 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:33:32,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:33:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:33:32,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:33:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:33:32,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:33:32,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:33:32,833 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:33:33,687 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:33:33,687 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:33:33,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:33 BoogieIcfgContainer [2019-12-27 22:33:33,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:33:33,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:33:33,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:33:33,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:33:33,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:33:31" (1/3) ... [2019-12-27 22:33:33,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae9294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:33, skipping insertion in model container [2019-12-27 22:33:33,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:32" (2/3) ... [2019-12-27 22:33:33,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae9294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:33, skipping insertion in model container [2019-12-27 22:33:33,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:33" (3/3) ... [2019-12-27 22:33:33,698 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2019-12-27 22:33:33,708 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:33:33,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:33:33,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:33:33,718 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:33:33,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,773 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,774 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,820 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,820 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,821 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,823 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,831 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:33,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:33:33,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:33:33,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:33:33,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:33:33,871 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:33:33,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:33:33,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:33:33,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:33:33,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:33:33,894 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 22:33:33,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:34,031 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:34,031 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:34,047 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:34,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:34,121 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:34,122 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:34,130 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:34,149 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:33:34,150 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:33:37,295 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-27 22:33:37,649 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:33:37,764 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:33:37,798 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 22:33:37,799 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:33:37,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 22:33:56,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 22:33:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 22:33:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:33:56,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:56,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:33:56,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:33:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 22:33:56,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:56,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55780629] [2019-12-27 22:33:56,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:33:56,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55780629] [2019-12-27 22:33:56,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:56,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:33:56,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597159007] [2019-12-27 22:33:56,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:56,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:56,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:33:56,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:56,680 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:56,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:33:56,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:56,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:33:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:33:56,696 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 22:33:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:33:57,974 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 22:33:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:33:57,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:33:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:01,839 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 22:34:01,840 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 22:34:01,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 22:34:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 22:34:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 22:34:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 22:34:11,785 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 22:34:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:11,785 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 22:34:11,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 22:34:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:34:11,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:11,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:11,790 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 22:34:11,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:11,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385088560] [2019-12-27 22:34:11,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:11,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385088560] [2019-12-27 22:34:11,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:11,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:11,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [925000886] [2019-12-27 22:34:11,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:11,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:11,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:34:11,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:11,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:11,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:11,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:11,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:11,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:11,919 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 22:34:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:16,959 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 22:34:16,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:16,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:34:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:17,702 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 22:34:17,702 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 22:34:17,703 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-27 22:34:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 22:34:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 22:34:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 22:34:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 22:34:35,329 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 22:34:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:35,330 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 22:34:35,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 22:34:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:35,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:35,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:35,337 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 22:34:35,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:35,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384835034] [2019-12-27 22:34:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:35,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384835034] [2019-12-27 22:34:35,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:35,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:35,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [195074607] [2019-12-27 22:34:35,395 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:35,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:35,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:35,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:35,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:35,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:35,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:35,399 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 22:34:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:35,552 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 22:34:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:35,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:34:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:35,614 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 22:34:35,614 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 22:34:35,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 22:34:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 22:34:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 22:34:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 22:34:41,546 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 22:34:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:41,546 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 22:34:41,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 22:34:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:41,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:41,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:41,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 22:34:41,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:41,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763061400] [2019-12-27 22:34:41,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:41,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763061400] [2019-12-27 22:34:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:41,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946374425] [2019-12-27 22:34:41,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:41,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:41,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:41,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:41,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:41,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:41,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:41,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:41,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:41,648 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 22:34:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:42,117 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 22:34:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:42,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:34:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:42,194 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 22:34:42,195 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 22:34:42,195 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-27 22:34:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 22:34:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 22:34:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 22:34:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 22:34:42,972 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 22:34:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:42,973 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 22:34:42,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 22:34:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:34:42,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:42,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:42,977 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:42,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 22:34:42,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:42,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939946521] [2019-12-27 22:34:42,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:43,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939946521] [2019-12-27 22:34:43,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:43,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:43,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577646685] [2019-12-27 22:34:43,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:43,100 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:43,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 22:34:43,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:43,162 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:43,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:43,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:43,164 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 6 states. [2019-12-27 22:34:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:44,283 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 22:34:44,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:34:44,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 22:34:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:44,372 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 22:34:44,372 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 22:34:44,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 22:34:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 22:34:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 22:34:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 22:34:45,127 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 22:34:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:45,128 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 22:34:45,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 22:34:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:34:45,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:45,141 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-27 22:34:45,141 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 22:34:45,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:45,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633472000] [2019-12-27 22:34:45,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:45,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633472000] [2019-12-27 22:34:45,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:45,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:45,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [628245516] [2019-12-27 22:34:45,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:45,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:45,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:34:45,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:45,227 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:45,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:45,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:45,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:45,228 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 5 states. [2019-12-27 22:34:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:45,278 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 22:34:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:34:45,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:34:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:45,289 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 22:34:45,289 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 22:34:45,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 22:34:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 22:34:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 22:34:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 22:34:45,383 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 22:34:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:45,383 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 22:34:45,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 22:34:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:34:45,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:45,394 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] [2019-12-27 22:34:45,394 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 22:34:45,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:45,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209952545] [2019-12-27 22:34:45,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:45,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209952545] [2019-12-27 22:34:45,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:45,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:34:45,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424155964] [2019-12-27 22:34:45,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:45,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:45,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 22:34:45,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:45,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:45,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:45,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:45,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:45,555 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 6 states. [2019-12-27 22:34:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:45,601 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 22:34:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:45,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 22:34:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:45,609 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 22:34:45,609 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 22:34:45,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 22:34:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 22:34:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 22:34:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 22:34:45,729 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 22:34:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:45,729 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 22:34:45,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 22:34:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:45,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:45,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:45,737 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 22:34:45,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515707153] [2019-12-27 22:34:45,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:45,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515707153] [2019-12-27 22:34:45,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:45,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:45,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594884471] [2019-12-27 22:34:45,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:45,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:46,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:46,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:46,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:46,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:46,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:46,057 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 22:34:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:46,118 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 22:34:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:46,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:46,125 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:34:46,125 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:34:46,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:34:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:34:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:34:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 22:34:46,190 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 22:34:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:46,191 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 22:34:46,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 22:34:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:46,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:46,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:46,199 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:46,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:46,199 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 22:34:46,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:46,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098905235] [2019-12-27 22:34:46,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:46,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098905235] [2019-12-27 22:34:46,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:46,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:46,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724451409] [2019-12-27 22:34:46,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:46,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:46,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:46,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:46,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:46,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:34:46,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:34:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:34:46,641 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 9 states. [2019-12-27 22:34:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:47,101 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 22:34:47,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:34:47,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 22:34:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:47,112 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:34:47,112 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:34:47,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:34:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:34:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:34:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 22:34:47,221 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 22:34:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:47,221 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 22:34:47,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:34:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 22:34:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:47,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:47,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:47,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 22:34:47,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281506647] [2019-12-27 22:34:47,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:47,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281506647] [2019-12-27 22:34:47,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:47,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:47,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10941133] [2019-12-27 22:34:47,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:47,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:47,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 558 transitions. [2019-12-27 22:34:47,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:47,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:34:47,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:47,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:47,905 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 14 states. [2019-12-27 22:34:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:50,222 INFO L93 Difference]: Finished difference Result 15419 states and 43654 transitions. [2019-12-27 22:34:50,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:34:50,222 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:50,241 INFO L225 Difference]: With dead ends: 15419 [2019-12-27 22:34:50,241 INFO L226 Difference]: Without dead ends: 15419 [2019-12-27 22:34:50,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:34:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15419 states. [2019-12-27 22:34:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15419 to 7035. [2019-12-27 22:34:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-12-27 22:34:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 20389 transitions. [2019-12-27 22:34:50,408 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 20389 transitions. Word has length 65 [2019-12-27 22:34:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:50,409 INFO L462 AbstractCegarLoop]: Abstraction has 7035 states and 20389 transitions. [2019-12-27 22:34:50,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 20389 transitions. [2019-12-27 22:34:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:50,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:50,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:50,423 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:50,423 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 22:34:50,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:50,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393571074] [2019-12-27 22:34:50,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:50,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393571074] [2019-12-27 22:34:50,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:50,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:34:50,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546010158] [2019-12-27 22:34:50,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:50,608 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:50,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 540 transitions. [2019-12-27 22:34:50,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:51,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 22:34:51,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:51,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:51,270 INFO L87 Difference]: Start difference. First operand 7035 states and 20389 transitions. Second operand 14 states. [2019-12-27 22:34:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:53,915 INFO L93 Difference]: Finished difference Result 14625 states and 41501 transitions. [2019-12-27 22:34:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:34:53,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:53,933 INFO L225 Difference]: With dead ends: 14625 [2019-12-27 22:34:53,934 INFO L226 Difference]: Without dead ends: 14625 [2019-12-27 22:34:53,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:34:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14625 states. [2019-12-27 22:34:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14625 to 6639. [2019-12-27 22:34:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-12-27 22:34:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 19226 transitions. [2019-12-27 22:34:54,089 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 19226 transitions. Word has length 65 [2019-12-27 22:34:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:54,089 INFO L462 AbstractCegarLoop]: Abstraction has 6639 states and 19226 transitions. [2019-12-27 22:34:54,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 19226 transitions. [2019-12-27 22:34:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:54,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:54,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:54,098 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-27 22:34:54,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:54,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775584707] [2019-12-27 22:34:54,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:54,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775584707] [2019-12-27 22:34:54,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:54,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:54,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398966410] [2019-12-27 22:34:54,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:54,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:54,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 488 transitions. [2019-12-27 22:34:54,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:54,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:54,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:54,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:54,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:54,382 INFO L87 Difference]: Start difference. First operand 6639 states and 19226 transitions. Second operand 6 states. [2019-12-27 22:34:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:54,592 INFO L93 Difference]: Finished difference Result 7948 states and 22269 transitions. [2019-12-27 22:34:54,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:54,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:34:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:54,603 INFO L225 Difference]: With dead ends: 7948 [2019-12-27 22:34:54,603 INFO L226 Difference]: Without dead ends: 7948 [2019-12-27 22:34:54,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2019-12-27 22:34:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 5826. [2019-12-27 22:34:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-27 22:34:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 16559 transitions. [2019-12-27 22:34:54,686 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 16559 transitions. Word has length 65 [2019-12-27 22:34:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:54,687 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 16559 transitions. [2019-12-27 22:34:54,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 16559 transitions. [2019-12-27 22:34:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:54,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:54,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:54,695 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash 523000800, now seen corresponding path program 1 times [2019-12-27 22:34:54,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:54,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756090287] [2019-12-27 22:34:54,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:54,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756090287] [2019-12-27 22:34:54,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:54,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:54,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403706454] [2019-12-27 22:34:54,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:54,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:55,068 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 283 states and 514 transitions. [2019-12-27 22:34:55,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:55,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:55,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:55,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:55,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:55,126 INFO L87 Difference]: Start difference. First operand 5826 states and 16559 transitions. Second operand 5 states. [2019-12-27 22:34:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:55,456 INFO L93 Difference]: Finished difference Result 8401 states and 23634 transitions. [2019-12-27 22:34:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:34:55,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:34:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:55,468 INFO L225 Difference]: With dead ends: 8401 [2019-12-27 22:34:55,468 INFO L226 Difference]: Without dead ends: 8401 [2019-12-27 22:34:55,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2019-12-27 22:34:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 6174. [2019-12-27 22:34:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2019-12-27 22:34:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 17592 transitions. [2019-12-27 22:34:55,563 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 17592 transitions. Word has length 66 [2019-12-27 22:34:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:55,563 INFO L462 AbstractCegarLoop]: Abstraction has 6174 states and 17592 transitions. [2019-12-27 22:34:55,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 17592 transitions. [2019-12-27 22:34:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:55,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:55,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:55,572 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1977715684, now seen corresponding path program 2 times [2019-12-27 22:34:55,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:55,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865292433] [2019-12-27 22:34:55,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:55,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865292433] [2019-12-27 22:34:55,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:55,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:34:55,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936962305] [2019-12-27 22:34:55,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:55,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:55,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 407 transitions. [2019-12-27 22:34:55,859 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:55,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:34:55,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:34:55,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:34:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:55,985 INFO L87 Difference]: Start difference. First operand 6174 states and 17592 transitions. Second operand 10 states. [2019-12-27 22:34:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:56,620 INFO L93 Difference]: Finished difference Result 8758 states and 24598 transitions. [2019-12-27 22:34:56,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:34:56,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 22:34:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:56,631 INFO L225 Difference]: With dead ends: 8758 [2019-12-27 22:34:56,632 INFO L226 Difference]: Without dead ends: 8758 [2019-12-27 22:34:56,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:34:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8758 states. [2019-12-27 22:34:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8758 to 6363. [2019-12-27 22:34:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6363 states. [2019-12-27 22:34:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 18148 transitions. [2019-12-27 22:34:56,730 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 18148 transitions. Word has length 66 [2019-12-27 22:34:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:56,730 INFO L462 AbstractCegarLoop]: Abstraction has 6363 states and 18148 transitions. [2019-12-27 22:34:56,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:34:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 18148 transitions. [2019-12-27 22:34:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:56,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:56,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:56,740 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1574627286, now seen corresponding path program 3 times [2019-12-27 22:34:56,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:56,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977222685] [2019-12-27 22:34:56,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:56,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977222685] [2019-12-27 22:34:56,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:56,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:34:56,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937948636] [2019-12-27 22:34:56,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:56,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:57,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 470 transitions. [2019-12-27 22:34:57,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:57,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 22:34:57,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:34:57,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:34:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:34:57,764 INFO L87 Difference]: Start difference. First operand 6363 states and 18148 transitions. Second operand 19 states. [2019-12-27 22:35:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:00,309 INFO L93 Difference]: Finished difference Result 18795 states and 52391 transitions. [2019-12-27 22:35:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:35:00,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-27 22:35:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:00,334 INFO L225 Difference]: With dead ends: 18795 [2019-12-27 22:35:00,334 INFO L226 Difference]: Without dead ends: 18795 [2019-12-27 22:35:00,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 21 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=1203, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:35:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18795 states. [2019-12-27 22:35:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18795 to 6627. [2019-12-27 22:35:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 22:35:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 18998 transitions. [2019-12-27 22:35:00,515 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 18998 transitions. Word has length 66 [2019-12-27 22:35:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:00,515 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 18998 transitions. [2019-12-27 22:35:00,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:35:00,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 18998 transitions. [2019-12-27 22:35:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:35:00,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:00,523 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1781036024, now seen corresponding path program 4 times [2019-12-27 22:35:00,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:00,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128983010] [2019-12-27 22:35:00,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:35:00,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128983010] [2019-12-27 22:35:00,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:00,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:35:00,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403267203] [2019-12-27 22:35:00,590 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:00,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:00,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 508 transitions. [2019-12-27 22:35:00,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:00,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:35:00,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:35:00,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:35:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:35:00,961 INFO L87 Difference]: Start difference. First operand 6627 states and 18998 transitions. Second operand 6 states. [2019-12-27 22:35:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:01,144 INFO L93 Difference]: Finished difference Result 8053 states and 22350 transitions. [2019-12-27 22:35:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:35:01,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 22:35:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:01,155 INFO L225 Difference]: With dead ends: 8053 [2019-12-27 22:35:01,156 INFO L226 Difference]: Without dead ends: 8053 [2019-12-27 22:35:01,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:35:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8053 states. [2019-12-27 22:35:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8053 to 5744. [2019-12-27 22:35:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5744 states. [2019-12-27 22:35:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5744 states to 5744 states and 16117 transitions. [2019-12-27 22:35:01,249 INFO L78 Accepts]: Start accepts. Automaton has 5744 states and 16117 transitions. Word has length 66 [2019-12-27 22:35:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:01,249 INFO L462 AbstractCegarLoop]: Abstraction has 5744 states and 16117 transitions. [2019-12-27 22:35:01,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:35:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5744 states and 16117 transitions. [2019-12-27 22:35:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:35:01,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:01,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:01,255 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1215710032, now seen corresponding path program 1 times [2019-12-27 22:35:01,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:01,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126390149] [2019-12-27 22:35:01,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:35:01,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126390149] [2019-12-27 22:35:01,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:01,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:35:01,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [629446595] [2019-12-27 22:35:01,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:01,341 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:01,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 506 transitions. [2019-12-27 22:35:01,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:01,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:35:01,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:35:01,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:35:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:35:01,547 INFO L87 Difference]: Start difference. First operand 5744 states and 16117 transitions. Second operand 3 states. [2019-12-27 22:35:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:01,600 INFO L93 Difference]: Finished difference Result 5744 states and 16116 transitions. [2019-12-27 22:35:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:35:01,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:35:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:01,608 INFO L225 Difference]: With dead ends: 5744 [2019-12-27 22:35:01,608 INFO L226 Difference]: Without dead ends: 5744 [2019-12-27 22:35:01,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:35:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2019-12-27 22:35:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 2990. [2019-12-27 22:35:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 22:35:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 22:35:01,661 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 22:35:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:01,661 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 22:35:01,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:35:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 22:35:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:35:01,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:01,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:01,664 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 22:35:01,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:01,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949114790] [2019-12-27 22:35:01,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:35:02,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949114790] [2019-12-27 22:35:02,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:02,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-27 22:35:02,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1037410459] [2019-12-27 22:35:02,370 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:02,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:02,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 472 transitions. [2019-12-27 22:35:02,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:02,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:03,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:35:04,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:04,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:04,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:35:04,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:05,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:05,237 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-27 22:35:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:05,422 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-27 22:35:05,423 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 22:35:05,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-27 22:35:05,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-27 22:35:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2299, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 22:35:05,426 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 51 states. [2019-12-27 22:35:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:16,710 INFO L93 Difference]: Finished difference Result 13438 states and 38330 transitions. [2019-12-27 22:35:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-27 22:35:16,711 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 68 [2019-12-27 22:35:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:16,732 INFO L225 Difference]: With dead ends: 13438 [2019-12-27 22:35:16,732 INFO L226 Difference]: Without dead ends: 13405 [2019-12-27 22:35:16,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3539 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1439, Invalid=10333, Unknown=0, NotChecked=0, Total=11772 [2019-12-27 22:35:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13405 states. [2019-12-27 22:35:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13405 to 4145. [2019-12-27 22:35:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 22:35:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11579 transitions. [2019-12-27 22:35:16,850 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11579 transitions. Word has length 68 [2019-12-27 22:35:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:16,851 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11579 transitions. [2019-12-27 22:35:16,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-27 22:35:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11579 transitions. [2019-12-27 22:35:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:35:16,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:16,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:16,855 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash -987957935, now seen corresponding path program 2 times [2019-12-27 22:35:16,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:16,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725372021] [2019-12-27 22:35:16,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:35:17,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725372021] [2019-12-27 22:35:17,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:17,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:35:17,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [134739974] [2019-12-27 22:35:17,294 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:17,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:17,580 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 412 transitions. [2019-12-27 22:35:17,581 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:18,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:18,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:35:18,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:35:18,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 22:35:18,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 22:35:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:35:18,528 INFO L87 Difference]: Start difference. First operand 4145 states and 11579 transitions. Second operand 27 states. [2019-12-27 22:35:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:24,074 INFO L93 Difference]: Finished difference Result 14287 states and 38726 transitions. [2019-12-27 22:35:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 22:35:24,074 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2019-12-27 22:35:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:24,092 INFO L225 Difference]: With dead ends: 14287 [2019-12-27 22:35:24,092 INFO L226 Difference]: Without dead ends: 14254 [2019-12-27 22:35:24,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=994, Invalid=4556, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 22:35:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14254 states. [2019-12-27 22:35:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14254 to 4821. [2019-12-27 22:35:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4821 states. [2019-12-27 22:35:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 13552 transitions. [2019-12-27 22:35:24,217 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 13552 transitions. Word has length 68 [2019-12-27 22:35:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:24,217 INFO L462 AbstractCegarLoop]: Abstraction has 4821 states and 13552 transitions. [2019-12-27 22:35:24,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 22:35:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 13552 transitions. [2019-12-27 22:35:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:35:24,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:24,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:24,224 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -194733731, now seen corresponding path program 3 times [2019-12-27 22:35:24,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:24,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829703043] [2019-12-27 22:35:24,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:35:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:35:24,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829703043] [2019-12-27 22:35:24,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:35:24,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:35:24,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630446805] [2019-12-27 22:35:24,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:35:24,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:35:24,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 413 transitions. [2019-12-27 22:35:24,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:35:25,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:35:25,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:35:25,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:35:25,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:35:25,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:35:25,011 INFO L87 Difference]: Start difference. First operand 4821 states and 13552 transitions. Second operand 15 states. [2019-12-27 22:35:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:35:25,690 INFO L93 Difference]: Finished difference Result 7565 states and 21252 transitions. [2019-12-27 22:35:25,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:35:25,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 22:35:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:35:25,700 INFO L225 Difference]: With dead ends: 7565 [2019-12-27 22:35:25,701 INFO L226 Difference]: Without dead ends: 7532 [2019-12-27 22:35:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-12-27 22:35:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7532 states. [2019-12-27 22:35:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7532 to 4145. [2019-12-27 22:35:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 22:35:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 22:35:25,773 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 22:35:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:35:25,773 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 22:35:25,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:35:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 22:35:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:35:25,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:35:25,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:35:25,777 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:35:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:35:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 4 times [2019-12-27 22:35:25,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:35:25,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697114990] [2019-12-27 22:35:25,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:35:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:35:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:35:25,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:35:25,887 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:35:25,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2192~0.base_27|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2192~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2192~0.base_27|) |v_ULTIMATE.start_main_~#t2192~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= v_~y~0_30 0) (= v_~x~0_13 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2192~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2192~0.base_27|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2192~0.base_27| 1)) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 |v_ULTIMATE.start_main_~#t2192~0.offset_20|) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ULTIMATE.start_main_~#t2194~0.base=|v_ULTIMATE.start_main_~#t2194~0.base_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2193~0.offset=|v_ULTIMATE.start_main_~#t2193~0.offset_18|, ULTIMATE.start_main_~#t2192~0.base=|v_ULTIMATE.start_main_~#t2192~0.base_27|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t2192~0.offset=|v_ULTIMATE.start_main_~#t2192~0.offset_20|, ULTIMATE.start_main_~#t2193~0.base=|v_ULTIMATE.start_main_~#t2193~0.base_23|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t2194~0.offset=|v_ULTIMATE.start_main_~#t2194~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2194~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2193~0.offset, ULTIMATE.start_main_~#t2192~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2192~0.offset, ULTIMATE.start_main_~#t2193~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2194~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:35:25,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2193~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2193~0.base_11|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2193~0.base_11| 1) |v_#valid_37|) (not (= |v_ULTIMATE.start_main_~#t2193~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2193~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2193~0.base_11|) |v_ULTIMATE.start_main_~#t2193~0.offset_10| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t2193~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2193~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2193~0.offset=|v_ULTIMATE.start_main_~#t2193~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2193~0.base=|v_ULTIMATE.start_main_~#t2193~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2193~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2193~0.base] because there is no mapped edge [2019-12-27 22:35:25,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:35:25,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2194~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2194~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2194~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2194~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2194~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2194~0.base_13|) |v_ULTIMATE.start_main_~#t2194~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2194~0.base_13| 4) |v_#length_17|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2194~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2194~0.offset=|v_ULTIMATE.start_main_~#t2194~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2194~0.base=|v_ULTIMATE.start_main_~#t2194~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2194~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2194~0.base, #length] because there is no mapped edge [2019-12-27 22:35:25,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1906212177 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1906212177 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1906212177 |P0Thread1of1ForFork0_#t~ite5_Out-1906212177|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1906212177|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906212177, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1906212177} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1906212177|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1906212177, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1906212177} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:35:25,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2110208182 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2110208182 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-2110208182| ~y~0_In-2110208182) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-2110208182 |P1Thread1of1ForFork1_#t~ite9_Out-2110208182|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2110208182, ~y$w_buff1~0=~y$w_buff1~0_In-2110208182, ~y~0=~y~0_In-2110208182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110208182} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2110208182, ~y$w_buff1~0=~y$w_buff1~0_In-2110208182, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-2110208182|, ~y~0=~y~0_In-2110208182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110208182} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:35:25,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In301300302 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In301300302 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In301300302 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In301300302 256)))) (or (and (= ~y$w_buff1_used~0_In301300302 |P0Thread1of1ForFork0_#t~ite6_Out301300302|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out301300302|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In301300302, ~y$w_buff0_used~0=~y$w_buff0_used~0_In301300302, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In301300302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In301300302} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out301300302|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In301300302, ~y$w_buff0_used~0=~y$w_buff0_used~0_In301300302, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In301300302, ~y$w_buff1_used~0=~y$w_buff1_used~0_In301300302} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:35:25,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In263747338 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In263747338 256)))) (or (and (= ~y$r_buff0_thd1~0_Out263747338 ~y$r_buff0_thd1~0_In263747338) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out263747338 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In263747338, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In263747338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In263747338, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out263747338|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out263747338} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:35:25,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1154529137 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1154529137 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1154529137 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1154529137 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1154529137 |P0Thread1of1ForFork0_#t~ite8_Out1154529137|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1154529137|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1154529137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1154529137, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1154529137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1154529137} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1154529137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1154529137, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1154529137|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1154529137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1154529137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:35:25,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, 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_11} 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-27 22:35:25,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1657073349 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1657073349 256)))) (or (and (= ~y$w_buff1~0_In1657073349 |P2Thread1of1ForFork2_#t~ite15_Out1657073349|) (not .cse0) (not .cse1)) (and (= ~y~0_In1657073349 |P2Thread1of1ForFork2_#t~ite15_Out1657073349|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1657073349, ~y$w_buff1~0=~y$w_buff1~0_In1657073349, ~y~0=~y~0_In1657073349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657073349} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1657073349, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1657073349|, ~y$w_buff1~0=~y$w_buff1~0_In1657073349, ~y~0=~y~0_In1657073349, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1657073349} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:35:25,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:35:25,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:35:25,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In278719601 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In278719601 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out278719601| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out278719601| ~y$w_buff0_used~0_In278719601)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278719601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278719601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In278719601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In278719601, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out278719601|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:35:25,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-735771002 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-735771002 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-735771002 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-735771002 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-735771002|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-735771002 |P1Thread1of1ForFork1_#t~ite12_Out-735771002|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-735771002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-735771002, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735771002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735771002} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-735771002, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-735771002, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735771002, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-735771002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-735771002} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:35:25,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-447148347 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-447148347 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-447148347|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-447148347 |P1Thread1of1ForFork1_#t~ite13_Out-447148347|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-447148347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-447148347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-447148347, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-447148347, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-447148347|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:35:25,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-1002894301 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1002894301 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1002894301 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1002894301 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1002894301 |P1Thread1of1ForFork1_#t~ite14_Out-1002894301|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1002894301|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1002894301, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002894301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1002894301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1002894301} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1002894301, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002894301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1002894301, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1002894301|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1002894301} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:35:25,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:35:25,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1701311746 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1701311746 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1701311746| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1701311746| ~y$w_buff0_used~0_In1701311746) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1701311746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1701311746} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1701311746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1701311746, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1701311746|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:35:25,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In615380505 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In615380505 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In615380505 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In615380505 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In615380505 |P2Thread1of1ForFork2_#t~ite18_Out615380505|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite18_Out615380505|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In615380505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In615380505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In615380505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In615380505} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In615380505, ~y$w_buff0_used~0=~y$w_buff0_used~0_In615380505, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In615380505, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out615380505|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In615380505} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:35:25,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2147095197 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2147095197 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-2147095197|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-2147095197 |P2Thread1of1ForFork2_#t~ite19_Out-2147095197|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2147095197, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2147095197} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2147095197, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2147095197, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-2147095197|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:35:25,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In-506848492 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-506848492 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-506848492 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-506848492 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-506848492|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-506848492 |P2Thread1of1ForFork2_#t~ite20_Out-506848492|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-506848492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-506848492, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-506848492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-506848492} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-506848492, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-506848492, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-506848492|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-506848492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-506848492} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:35:25,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:35:25,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:35:25,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1169431095 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1169431095 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out1169431095| |ULTIMATE.start_main_#t~ite24_Out1169431095|))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In1169431095 |ULTIMATE.start_main_#t~ite24_Out1169431095|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1169431095 |ULTIMATE.start_main_#t~ite24_Out1169431095|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1169431095, ~y~0=~y~0_In1169431095, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1169431095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1169431095} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1169431095, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1169431095|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1169431095|, ~y~0=~y~0_In1169431095, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1169431095, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1169431095} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:35:25,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2049095543 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2049095543 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-2049095543| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2049095543 |ULTIMATE.start_main_#t~ite26_Out-2049095543|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2049095543, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2049095543} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2049095543, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2049095543, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-2049095543|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:35:25,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1847751804 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1847751804 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1847751804 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1847751804 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1847751804 |ULTIMATE.start_main_#t~ite27_Out1847751804|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite27_Out1847751804|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1847751804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1847751804, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1847751804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1847751804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1847751804, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1847751804, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1847751804|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1847751804, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1847751804} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:35:25,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-127299317 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-127299317 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-127299317| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-127299317 |ULTIMATE.start_main_#t~ite28_Out-127299317|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-127299317, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-127299317} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-127299317|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-127299317, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-127299317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:35:25,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1028021195 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1028021195 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1028021195 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1028021195 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1028021195| 0)) (and (= |ULTIMATE.start_main_#t~ite29_Out-1028021195| ~y$r_buff1_thd0~0_In-1028021195) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1028021195, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1028021195, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1028021195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1028021195} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1028021195, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1028021195|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1028021195, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1028021195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1028021195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:35:25,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In288573823 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out288573823| ~y$w_buff1~0_In288573823) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In288573823| |ULTIMATE.start_main_#t~ite38_Out288573823|)) (and (= |ULTIMATE.start_main_#t~ite38_Out288573823| ~y$w_buff1~0_In288573823) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In288573823 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In288573823 256))) (= 0 (mod ~y$w_buff0_used~0_In288573823 256)) (and (= (mod ~y$r_buff1_thd0~0_In288573823 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out288573823| |ULTIMATE.start_main_#t~ite38_Out288573823|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In288573823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In288573823, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288573823, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In288573823|, ~weak$$choice2~0=~weak$$choice2~0_In288573823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288573823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288573823} OutVars{~y$w_buff1~0=~y$w_buff1~0_In288573823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In288573823, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out288573823|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288573823, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out288573823|, ~weak$$choice2~0=~weak$$choice2~0_In288573823, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288573823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288573823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 22:35:25,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1347272973 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite41_Out1347272973| ~y$w_buff0_used~0_In1347272973) (= |ULTIMATE.start_main_#t~ite41_Out1347272973| |ULTIMATE.start_main_#t~ite42_Out1347272973|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1347272973 256)))) (or (= (mod ~y$w_buff0_used~0_In1347272973 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1347272973 256))) (and (= 0 (mod ~y$w_buff1_used~0_In1347272973 256)) .cse1)))) (and (= ~y$w_buff0_used~0_In1347272973 |ULTIMATE.start_main_#t~ite42_Out1347272973|) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In1347272973| |ULTIMATE.start_main_#t~ite41_Out1347272973|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1347272973|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1347272973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1347272973, ~weak$$choice2~0=~weak$$choice2~0_In1347272973, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1347272973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1347272973} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1347272973|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1347272973, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1347272973, ~weak$$choice2~0=~weak$$choice2~0_In1347272973, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1347272973|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1347272973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1347272973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:35:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:35:25,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:35:25,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:35:26,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:35:26 BasicIcfg [2019-12-27 22:35:26,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:35:26,027 INFO L168 Benchmark]: Toolchain (without parser) took 114290.03 ms. Allocated memory was 143.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,028 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.87 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 100.5 MB in the beginning and 157.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.45 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,029 INFO L168 Benchmark]: Boogie Preprocessor took 40.04 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,032 INFO L168 Benchmark]: RCFGBuilder took 934.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,033 INFO L168 Benchmark]: TraceAbstraction took 112335.38 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 22:35:26,040 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.24 ms. Allocated memory is still 143.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 898.87 ms. Allocated memory was 143.7 MB in the beginning and 203.9 MB in the end (delta: 60.3 MB). Free memory was 100.5 MB in the beginning and 157.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.45 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.04 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 934.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.8 MB in the beginning and 101.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112335.38 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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) [L804] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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 [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 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 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 112.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 40.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3488 SDtfs, 7429 SDslu, 14386 SDs, 0 SdLazy, 17678 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 616 GetRequests, 168 SyntacticMatches, 82 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6175 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 97837 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 961 ConstructedInterpolants, 0 QuantifiedInterpolants, 240850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...