/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_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:33:16,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:33:16,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:33:16,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:33:16,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:33:16,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:33:16,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:33:16,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:33:16,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:33:16,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:33:16,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:33:16,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:33:16,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:33:16,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:33:16,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:33:16,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:33:16,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:33:16,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:33:16,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:33:16,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:33:16,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:33:16,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:33:16,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:33:16,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:33:16,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:33:16,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:33:16,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:33:16,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:33:16,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:33:16,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:33:16,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:33:16,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:33:16,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:33:16,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:33:16,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:33:16,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:33:16,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:33:16,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:33:16,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:33:16,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:33:16,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:33:16,466 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:16,481 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:33:16,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:33:16,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:33:16,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:33:16,483 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:33:16,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:33:16,483 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:33:16,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:33:16,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:33:16,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:33:16,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:33:16,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:33:16,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:33:16,485 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:33:16,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:33:16,485 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:33:16,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:33:16,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:33:16,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:33:16,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:33:16,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:33:16,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:16,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:33:16,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:33:16,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:33:16,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:33:16,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:33:16,487 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:33:16,488 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:33:16,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:33:16,488 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:33:16,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:33:16,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:33:16,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:33:16,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:33:16,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:33:16,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:33:16,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2019-12-27 22:33:16,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b89fe8a/5998f93108f54408b0145cc44d31d1af/FLAG04e958c8e [2019-12-27 22:33:17,375 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:33:17,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2019-12-27 22:33:17,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b89fe8a/5998f93108f54408b0145cc44d31d1af/FLAG04e958c8e [2019-12-27 22:33:17,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30b89fe8a/5998f93108f54408b0145cc44d31d1af [2019-12-27 22:33:17,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:33:17,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:33:17,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:17,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:33:17,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:33:17,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:17" (1/1) ... [2019-12-27 22:33:17,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:17, skipping insertion in model container [2019-12-27 22:33:17,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:17" (1/1) ... [2019-12-27 22:33:17,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:33:17,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:33:18,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:18,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:33:18,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:18,582 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:33:18,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:18 WrapperNode [2019-12-27 22:33:18,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:18,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:18,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:33:18,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:33:18,593 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:18" (1/1) ... [2019-12-27 22:33:18,638 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:18" (1/1) ... [2019-12-27 22:33:18,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:18,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:33:18,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:33:18,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:33:18,694 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:18" (1/1) ... [2019-12-27 22:33:18,694 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:18" (1/1) ... [2019-12-27 22:33:18,699 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:18" (1/1) ... [2019-12-27 22:33:18,699 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:18" (1/1) ... [2019-12-27 22:33:18,710 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:18" (1/1) ... [2019-12-27 22:33:18,714 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:18" (1/1) ... [2019-12-27 22:33:18,718 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:18" (1/1) ... [2019-12-27 22:33:18,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:33:18,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:33:18,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:33:18,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:33:18,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:18" (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:18,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:33:18,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:33:18,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:33:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:33:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:33:18,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:33:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:33:18,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:33:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:33:18,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:33:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:33:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:33:18,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:33:18,809 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:19,613 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:33:19,613 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:33:19,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:19 BoogieIcfgContainer [2019-12-27 22:33:19,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:33:19,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:33:19,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:33:19,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:33:19,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:33:17" (1/3) ... [2019-12-27 22:33:19,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:19, skipping insertion in model container [2019-12-27 22:33:19,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:18" (2/3) ... [2019-12-27 22:33:19,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d489b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:19, skipping insertion in model container [2019-12-27 22:33:19,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:19" (3/3) ... [2019-12-27 22:33:19,624 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2019-12-27 22:33:19,632 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:33:19,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:33:19,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:33:19,640 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:33:19,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,685 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,685 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:19,686 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,686 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,702 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,742 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:19,742 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,745 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:19,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:33:19,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:33:19,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:33:19,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:33:19,786 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:33:19,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:33:19,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:33:19,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:33:19,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:33:19,808 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 22:33:19,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:19,929 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:19,930 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:19,945 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:19,967 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:20,058 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:20,058 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:20,070 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:20,093 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:33:20,095 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:33:23,563 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:33:23,675 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:33:23,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 22:33:23,704 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:33:23,707 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 22:33:42,551 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 22:33:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 22:33:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:33:42,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:42,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:33:42,560 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:42,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 22:33:42,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:42,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429791199] [2019-12-27 22:33:42,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:42,770 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:42,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429791199] [2019-12-27 22:33:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:33:42,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602961820] [2019-12-27 22:33:42,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:42,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:42,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:33:42,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:42,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:42,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:33:42,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:33:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:33:42,818 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 22:33:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:33:45,697 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 22:33:45,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:33:45,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:33:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:33:46,459 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 22:33:46,459 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 22:33:46,464 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:33:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 22:33:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 22:33:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 22:33:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 22:33:56,603 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 22:33:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:33:56,604 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 22:33:56,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:33:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 22:33:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:33:56,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:56,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:33:56,610 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:33:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 22:33:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:56,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244514528] [2019-12-27 22:33:56,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:56,793 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,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244514528] [2019-12-27 22:33:56,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:56,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:33:56,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635691276] [2019-12-27 22:33:56,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:56,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:56,803 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:33:56,803 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:56,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:56,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:33:56,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:33:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:33:56,806 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 22:34:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:02,083 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 22:34:02,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:02,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:34:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:03,293 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 22:34:03,294 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 22:34:03,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 22:34:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 22:34:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 22:34:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 22:34:19,058 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 22:34:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:19,059 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 22:34:19,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 22:34:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:19,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:19,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:19,068 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:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 22:34:19,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:19,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211064775] [2019-12-27 22:34:19,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:19,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211064775] [2019-12-27 22:34:19,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:19,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:19,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758113009] [2019-12-27 22:34:19,122 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:19,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:19,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:19,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:19,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:19,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:19,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:19,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:19,127 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 22:34:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:19,274 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 22:34:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:19,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:34:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:19,336 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 22:34:19,336 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 22:34:19,337 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:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 22:34:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 22:34:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 22:34:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 22:34:21,098 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 22:34:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:21,099 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 22:34:21,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 22:34:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:21,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:21,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:21,101 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:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 22:34:21,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:21,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630054962] [2019-12-27 22:34:21,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:21,174 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:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630054962] [2019-12-27 22:34:21,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:21,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:21,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1295566911] [2019-12-27 22:34:21,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:21,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:21,177 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:21,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:21,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:21,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:21,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:21,179 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 22:34:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:21,635 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 22:34:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:21,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:34:21,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:21,718 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 22:34:21,718 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 22:34:21,718 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:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 22:34:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 22:34:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 22:34:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 22:34:22,490 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 22:34:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:22,490 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 22:34:22,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 22:34:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:34:22,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:22,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:22,496 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:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 22:34:22,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:22,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56835353] [2019-12-27 22:34:22,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:24,655 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:24,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56835353] [2019-12-27 22:34:24,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:24,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:24,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1745050862] [2019-12-27 22:34:24,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:24,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:24,664 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 22:34:24,664 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:24,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:24,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:24,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:24,722 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 6 states. [2019-12-27 22:34:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:25,600 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 22:34:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:34:25,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 22:34:25,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:25,713 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 22:34:25,713 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 22:34:25,714 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:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 22:34:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 22:34:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 22:34:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 22:34:26,585 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 22:34:26,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:26,586 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 22:34:26,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 22:34:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:34:26,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:26,601 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:26,601 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:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 22:34:26,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:26,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965500121] [2019-12-27 22:34:26,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:26,700 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:26,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965500121] [2019-12-27 22:34:26,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:26,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:26,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1084523899] [2019-12-27 22:34:26,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:26,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:26,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:34:26,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:26,737 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:26,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:26,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:26,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:26,738 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 5 states. [2019-12-27 22:34:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:26,783 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 22:34:26,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:34:26,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:34:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:26,793 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 22:34:26,793 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 22:34:26,793 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:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 22:34:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 22:34:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 22:34:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 22:34:26,894 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 22:34:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:26,894 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 22:34:26,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 22:34:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:34:26,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:26,906 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:26,906 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:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 22:34:26,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:26,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666195233] [2019-12-27 22:34:26,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:26,990 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:26,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666195233] [2019-12-27 22:34:26,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:26,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:34:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1398147517] [2019-12-27 22:34:26,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:27,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:27,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 22:34:27,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:27,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:27,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:27,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:27,052 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 6 states. [2019-12-27 22:34:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:27,092 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 22:34:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:27,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 22:34:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:27,150 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 22:34:27,150 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 22:34:27,150 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:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 22:34:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 22:34:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 22:34:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 22:34:27,219 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 22:34:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:27,219 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 22:34:27,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 22:34:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:27,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:27,227 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:27,227 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:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:27,228 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 22:34:27,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:27,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495965326] [2019-12-27 22:34:27,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:27,306 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:27,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495965326] [2019-12-27 22:34:27,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:27,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:27,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1706568827] [2019-12-27 22:34:27,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:27,333 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:27,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:27,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:27,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:27,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:27,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:27,552 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 22:34:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:27,614 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 22:34:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:27,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:27,622 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:34:27,622 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:34:27,622 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:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:34:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:34:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:34:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 22:34:27,690 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 22:34:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:27,692 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 22:34:27,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 22:34:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:27,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:27,699 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:27,699 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:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 22:34:27,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:27,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297970222] [2019-12-27 22:34:27,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:27,813 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:27,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297970222] [2019-12-27 22:34:27,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:27,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:27,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24166606] [2019-12-27 22:34:27,815 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:27,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:28,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:28,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:28,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:28,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:34:28,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:34:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:34:28,147 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 9 states. [2019-12-27 22:34:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:28,612 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 22:34:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:34:28,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 22:34:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:28,622 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:34:28,622 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:34:28,623 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:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:34:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:34:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:34:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 22:34:28,714 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 22:34:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:28,714 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 22:34:28,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:34:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 22:34:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:28,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:28,723 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:28,724 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:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 22:34:28,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:28,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632927846] [2019-12-27 22:34:28,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:28,837 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:28,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632927846] [2019-12-27 22:34:28,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:28,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:28,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016253907] [2019-12-27 22:34:28,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:28,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:29,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 558 transitions. [2019-12-27 22:34:29,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:29,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:34:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:29,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:29,375 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 14 states. [2019-12-27 22:34:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:31,583 INFO L93 Difference]: Finished difference Result 15419 states and 43654 transitions. [2019-12-27 22:34:31,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:34:31,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:31,605 INFO L225 Difference]: With dead ends: 15419 [2019-12-27 22:34:31,605 INFO L226 Difference]: Without dead ends: 15419 [2019-12-27 22:34:31,605 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:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15419 states. [2019-12-27 22:34:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15419 to 7035. [2019-12-27 22:34:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-12-27 22:34:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 20389 transitions. [2019-12-27 22:34:31,782 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 20389 transitions. Word has length 65 [2019-12-27 22:34:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:31,782 INFO L462 AbstractCegarLoop]: Abstraction has 7035 states and 20389 transitions. [2019-12-27 22:34:31,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 20389 transitions. [2019-12-27 22:34:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:31,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:31,797 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:31,797 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:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 22:34:31,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:31,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335003490] [2019-12-27 22:34:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:32,005 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:32,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335003490] [2019-12-27 22:34:32,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:32,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:34:32,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [156610172] [2019-12-27 22:34:32,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:32,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:32,273 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 540 transitions. [2019-12-27 22:34:32,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:32,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:34:32,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:34:32,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:34:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:34:32,553 INFO L87 Difference]: Start difference. First operand 7035 states and 20389 transitions. Second operand 15 states. [2019-12-27 22:34:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:35,139 INFO L93 Difference]: Finished difference Result 14625 states and 41501 transitions. [2019-12-27 22:34:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:34:35,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 22:34:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:35,160 INFO L225 Difference]: With dead ends: 14625 [2019-12-27 22:34:35,160 INFO L226 Difference]: Without dead ends: 14625 [2019-12-27 22:34:35,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:34:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14625 states. [2019-12-27 22:34:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14625 to 6639. [2019-12-27 22:34:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6639 states. [2019-12-27 22:34:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 19226 transitions. [2019-12-27 22:34:35,328 INFO L78 Accepts]: Start accepts. Automaton has 6639 states and 19226 transitions. Word has length 65 [2019-12-27 22:34:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:35,328 INFO L462 AbstractCegarLoop]: Abstraction has 6639 states and 19226 transitions. [2019-12-27 22:34:35,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:34:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 6639 states and 19226 transitions. [2019-12-27 22:34:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,338 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:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 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 [766465133] [2019-12-27 22:34:35,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:35,406 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,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766465133] [2019-12-27 22:34:35,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:35,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:35,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [105945090] [2019-12-27 22:34:35,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:35,427 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:35,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 488 transitions. [2019-12-27 22:34:35,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:35,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:35,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:35,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:35,680 INFO L87 Difference]: Start difference. First operand 6639 states and 19226 transitions. Second operand 6 states. [2019-12-27 22:34:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:35,900 INFO L93 Difference]: Finished difference Result 7948 states and 22269 transitions. [2019-12-27 22:34:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:35,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 22:34:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:35,912 INFO L225 Difference]: With dead ends: 7948 [2019-12-27 22:34:35,912 INFO L226 Difference]: Without dead ends: 7948 [2019-12-27 22:34:35,913 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:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2019-12-27 22:34:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 5826. [2019-12-27 22:34:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-27 22:34:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 16559 transitions. [2019-12-27 22:34:36,047 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 16559 transitions. Word has length 65 [2019-12-27 22:34:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:36,047 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 16559 transitions. [2019-12-27 22:34:36,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 16559 transitions. [2019-12-27 22:34:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:36,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:36,059 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:36,060 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:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash 523000800, now seen corresponding path program 1 times [2019-12-27 22:34:36,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:36,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688945741] [2019-12-27 22:34:36,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:36,156 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:36,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688945741] [2019-12-27 22:34:36,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:36,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:36,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [359015543] [2019-12-27 22:34:36,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:36,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:36,393 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 283 states and 514 transitions. [2019-12-27 22:34:36,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:36,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:36,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:36,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:36,443 INFO L87 Difference]: Start difference. First operand 5826 states and 16559 transitions. Second operand 5 states. [2019-12-27 22:34:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:36,797 INFO L93 Difference]: Finished difference Result 8401 states and 23634 transitions. [2019-12-27 22:34:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:34:36,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:34:36,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:36,809 INFO L225 Difference]: With dead ends: 8401 [2019-12-27 22:34:36,809 INFO L226 Difference]: Without dead ends: 8401 [2019-12-27 22:34:36,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2019-12-27 22:34:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 6174. [2019-12-27 22:34:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2019-12-27 22:34:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 17592 transitions. [2019-12-27 22:34:36,911 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 17592 transitions. Word has length 66 [2019-12-27 22:34:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:36,911 INFO L462 AbstractCegarLoop]: Abstraction has 6174 states and 17592 transitions. [2019-12-27 22:34:36,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 17592 transitions. [2019-12-27 22:34:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:36,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:36,920 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:36,920 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:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1977715684, now seen corresponding path program 2 times [2019-12-27 22:34:36,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:36,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557100337] [2019-12-27 22:34:36,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:37,033 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:37,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557100337] [2019-12-27 22:34:37,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:37,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:37,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1408795037] [2019-12-27 22:34:37,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:37,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:37,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 407 transitions. [2019-12-27 22:34:37,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:37,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:34:37,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:34:37,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:37,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:34:37,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:34:37,312 INFO L87 Difference]: Start difference. First operand 6174 states and 17592 transitions. Second operand 9 states. [2019-12-27 22:34:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:37,988 INFO L93 Difference]: Finished difference Result 8758 states and 24598 transitions. [2019-12-27 22:34:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:34:37,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 22:34:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:38,001 INFO L225 Difference]: With dead ends: 8758 [2019-12-27 22:34:38,002 INFO L226 Difference]: Without dead ends: 8758 [2019-12-27 22:34:38,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:34:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8758 states. [2019-12-27 22:34:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8758 to 6363. [2019-12-27 22:34:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6363 states. [2019-12-27 22:34:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 18148 transitions. [2019-12-27 22:34:38,111 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 18148 transitions. Word has length 66 [2019-12-27 22:34:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:38,111 INFO L462 AbstractCegarLoop]: Abstraction has 6363 states and 18148 transitions. [2019-12-27 22:34:38,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:34:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 18148 transitions. [2019-12-27 22:34:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:38,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:38,123 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:38,123 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:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1574627286, now seen corresponding path program 3 times [2019-12-27 22:34:38,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:38,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385831971] [2019-12-27 22:34:38,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:38,282 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:38,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385831971] [2019-12-27 22:34:38,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:38,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:34:38,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462550616] [2019-12-27 22:34:38,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:38,311 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:38,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 470 transitions. [2019-12-27 22:34:38,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:38,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:38,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:39,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 22:34:39,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 22:34:39,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 22:34:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:34:39,038 INFO L87 Difference]: Start difference. First operand 6363 states and 18148 transitions. Second operand 18 states. [2019-12-27 22:34:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:41,730 INFO L93 Difference]: Finished difference Result 18277 states and 51032 transitions. [2019-12-27 22:34:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 22:34:41,731 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 22:34:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:41,755 INFO L225 Difference]: With dead ends: 18277 [2019-12-27 22:34:41,755 INFO L226 Difference]: Without dead ends: 18277 [2019-12-27 22:34:41,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=510, Invalid=1842, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 22:34:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18277 states. [2019-12-27 22:34:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18277 to 6627. [2019-12-27 22:34:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 22:34:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 18998 transitions. [2019-12-27 22:34:41,927 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 18998 transitions. Word has length 66 [2019-12-27 22:34:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:41,927 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 18998 transitions. [2019-12-27 22:34:41,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 22:34:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 18998 transitions. [2019-12-27 22:34:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:41,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:41,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,935 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:34:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1781036024, now seen corresponding path program 4 times [2019-12-27 22:34:41,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:41,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312223255] [2019-12-27 22:34:41,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:42,036 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:42,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312223255] [2019-12-27 22:34:42,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:42,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:42,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [959702898] [2019-12-27 22:34:42,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:42,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:42,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 508 transitions. [2019-12-27 22:34:42,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:42,271 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:42,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:42,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:42,272 INFO L87 Difference]: Start difference. First operand 6627 states and 18998 transitions. Second operand 3 states. [2019-12-27 22:34:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:42,328 INFO L93 Difference]: Finished difference Result 6627 states and 18997 transitions. [2019-12-27 22:34:42,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:42,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:34:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:42,338 INFO L225 Difference]: With dead ends: 6627 [2019-12-27 22:34:42,338 INFO L226 Difference]: Without dead ends: 6627 [2019-12-27 22:34:42,338 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:34:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2019-12-27 22:34:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 4034. [2019-12-27 22:34:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-27 22:34:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 11701 transitions. [2019-12-27 22:34:42,410 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 11701 transitions. Word has length 66 [2019-12-27 22:34:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:42,410 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 11701 transitions. [2019-12-27 22:34:42,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 11701 transitions. [2019-12-27 22:34:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:34:42,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:42,414 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:34:42,415 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:34:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1372470305, now seen corresponding path program 1 times [2019-12-27 22:34:42,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:42,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339750747] [2019-12-27 22:34:42,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:42,487 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:42,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339750747] [2019-12-27 22:34:42,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:42,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:42,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [221203379] [2019-12-27 22:34:42,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:42,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:42,654 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 421 transitions. [2019-12-27 22:34:42,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:42,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:42,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:42,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:42,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:42,659 INFO L87 Difference]: Start difference. First operand 4034 states and 11701 transitions. Second operand 3 states. [2019-12-27 22:34:42,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:42,678 INFO L93 Difference]: Finished difference Result 3724 states and 10546 transitions. [2019-12-27 22:34:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:42,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:34:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:42,682 INFO L225 Difference]: With dead ends: 3724 [2019-12-27 22:34:42,682 INFO L226 Difference]: Without dead ends: 3724 [2019-12-27 22:34:42,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 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:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2019-12-27 22:34:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 2990. [2019-12-27 22:34:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 22:34:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 22:34:42,727 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 22:34:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:42,727 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 22:34:42,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 22:34:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:42,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:42,730 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:34:42,730 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:34:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 22:34:42,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:42,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331757692] [2019-12-27 22:34:42,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:42,976 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:42,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331757692] [2019-12-27 22:34:42,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:42,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:34:42,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [362426789] [2019-12-27 22:34:42,977 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:43,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:43,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 472 transitions. [2019-12-27 22:34:43,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:43,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:34:43,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:43,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:43,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:43,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:43,556 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 14 states. [2019-12-27 22:34:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:44,056 INFO L93 Difference]: Finished difference Result 5799 states and 16480 transitions. [2019-12-27 22:34:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:34:44,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 22:34:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:44,065 INFO L225 Difference]: With dead ends: 5799 [2019-12-27 22:34:44,065 INFO L226 Difference]: Without dead ends: 5766 [2019-12-27 22:34:44,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:34:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-12-27 22:34:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 4145. [2019-12-27 22:34:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 22:34:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 22:34:44,141 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 22:34:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:44,142 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 22:34:44,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 22:34:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:44,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:44,146 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:34:44,146 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:34:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 2 times [2019-12-27 22:34:44,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:44,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875891927] [2019-12-27 22:34:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:44,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:34:44,272 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:34:44,276 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 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) (< 0 |v_#StackHeapBarrier_17|) (= 0 |v_ULTIMATE.start_main_~#t2186~0.offset_20|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 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) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2186~0.base_27|) 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2186~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2186~0.base_27|) |v_ULTIMATE.start_main_~#t2186~0.offset_20| 0))) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2186~0.base_27|) (= 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_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_19|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #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_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_16|, 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_~#t2186~0.base=|v_ULTIMATE.start_main_~#t2186~0.base_27|, 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_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~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|, ~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_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_18|, 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_~#t2186~0.offset=|v_ULTIMATE.start_main_~#t2186~0.offset_20|, 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_~#t2188~0.base, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #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_~#t2188~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2186~0.base, 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_~#t2187~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, ~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_~#t2187~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2186~0.offset, 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:34:44,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2187~0.base_11|) |v_ULTIMATE.start_main_~#t2187~0.offset_10| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t2187~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2187~0.base_11|)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2187~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2187~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2187~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|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2187~0.offset=|v_ULTIMATE.start_main_~#t2187~0.offset_10|, ULTIMATE.start_main_~#t2187~0.base=|v_ULTIMATE.start_main_~#t2187~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2187~0.offset, ULTIMATE.start_main_~#t2187~0.base] because there is no mapped edge [2019-12-27 22:34:44,277 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:34:44,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2188~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2188~0.base_13|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2188~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2188~0.base_13|) |v_ULTIMATE.start_main_~#t2188~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2188~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2188~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t2188~0.base=|v_ULTIMATE.start_main_~#t2188~0.base_13|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2188~0.offset=|v_ULTIMATE.start_main_~#t2188~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t2188~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2188~0.offset] because there is no mapped edge [2019-12-27 22:34:44,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-115586796 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-115586796 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-115586796|) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-115586796| ~y$w_buff0_used~0_In-115586796)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-115586796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-115586796} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-115586796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-115586796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-115586796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:34:44,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1487586738 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1487586738 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1487586738 |P1Thread1of1ForFork1_#t~ite9_Out-1487586738|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-1487586738| ~y~0_In-1487586738)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1487586738, ~y$w_buff1~0=~y$w_buff1~0_In-1487586738, ~y~0=~y~0_In-1487586738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1487586738} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1487586738, ~y$w_buff1~0=~y$w_buff1~0_In-1487586738, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1487586738|, ~y~0=~y~0_In-1487586738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1487586738} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:34:44,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-1689506231 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1689506231 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1689506231 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1689506231 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1689506231 |P0Thread1of1ForFork0_#t~ite6_Out-1689506231|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1689506231|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1689506231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689506231, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1689506231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689506231} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1689506231|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1689506231, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689506231, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1689506231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689506231} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:34:44,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1221286460 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1221286460 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1221286460 ~y$r_buff0_thd1~0_Out-1221286460) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1221286460) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221286460, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1221286460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221286460, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1221286460|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1221286460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:34:44,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1767320886 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1767320886 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1767320886 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1767320886 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1767320886| ~y$r_buff1_thd1~0_In1767320886)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1767320886| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1767320886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1767320886, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767320886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1767320886} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1767320886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1767320886, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1767320886|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1767320886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1767320886} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:34:44,283 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:34:44,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-295284655 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-295284655 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-295284655| ~y$w_buff1~0_In-295284655)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-295284655| ~y~0_In-295284655)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-295284655, ~y$w_buff1~0=~y$w_buff1~0_In-295284655, ~y~0=~y~0_In-295284655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-295284655} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-295284655, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-295284655|, ~y$w_buff1~0=~y$w_buff1~0_In-295284655, ~y~0=~y~0_In-295284655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-295284655} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:34:44,284 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:34:44,285 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:34:44,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1092310223 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1092310223 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1092310223|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1092310223 |P1Thread1of1ForFork1_#t~ite11_Out1092310223|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1092310223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1092310223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1092310223, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1092310223, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1092310223|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:34:44,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1011215136 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1011215136 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1011215136 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1011215136 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1011215136|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1011215136 |P1Thread1of1ForFork1_#t~ite12_Out1011215136|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011215136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011215136, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011215136} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011215136, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011215136, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011215136, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1011215136|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011215136} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:34:44,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1628468268 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1628468268 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1628468268|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1628468268| ~y$r_buff0_thd2~0_In-1628468268) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628468268, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628468268} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628468268, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628468268, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1628468268|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:34:44,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1084524133 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In1084524133 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1084524133 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1084524133 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1084524133|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1084524133 |P1Thread1of1ForFork1_#t~ite14_Out1084524133|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1084524133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084524133, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1084524133, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1084524133} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1084524133, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1084524133, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1084524133, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1084524133|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1084524133} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:34:44,287 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:34:44,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1344914148 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1344914148 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1344914148|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1344914148 |P2Thread1of1ForFork2_#t~ite17_Out-1344914148|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1344914148} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344914148, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1344914148, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1344914148|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:34:44,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1449209705 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1449209705 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1449209705 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1449209705 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1449209705| 0)) (and (= ~y$w_buff1_used~0_In-1449209705 |P2Thread1of1ForFork2_#t~ite18_Out-1449209705|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1449209705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1449209705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449209705} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1449209705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449209705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1449209705, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1449209705|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449209705} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:34:44,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1179010153 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1179010153 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1179010153|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-1179010153 |P2Thread1of1ForFork2_#t~ite19_Out-1179010153|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179010153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1179010153} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1179010153, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1179010153, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1179010153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:34:44,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1463934898 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1463934898 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1463934898 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1463934898 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1463934898|)) (and (= ~y$r_buff1_thd3~0_In1463934898 |P2Thread1of1ForFork2_#t~ite20_Out1463934898|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1463934898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1463934898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1463934898} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1463934898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1463934898, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1463934898|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1463934898, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1463934898} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:34:44,289 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:34:44,290 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:34:44,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In277034492 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In277034492 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite25_Out277034492| |ULTIMATE.start_main_#t~ite24_Out277034492|))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In277034492 |ULTIMATE.start_main_#t~ite24_Out277034492|)) (and (or .cse1 .cse2) (= ~y~0_In277034492 |ULTIMATE.start_main_#t~ite24_Out277034492|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In277034492, ~y~0=~y~0_In277034492, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In277034492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277034492} OutVars{~y$w_buff1~0=~y$w_buff1~0_In277034492, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out277034492|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out277034492|, ~y~0=~y~0_In277034492, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In277034492, ~y$w_buff1_used~0=~y$w_buff1_used~0_In277034492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:34:44,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1362517174 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1362517174 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1362517174 |ULTIMATE.start_main_#t~ite26_Out-1362517174|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1362517174|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1362517174} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362517174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1362517174, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1362517174|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:34:44,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1967626178 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1967626178 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1967626178 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1967626178 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1967626178|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1967626178 |ULTIMATE.start_main_#t~ite27_Out-1967626178|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1967626178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1967626178, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1967626178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1967626178} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1967626178, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1967626178, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1967626178|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1967626178, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1967626178} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:34:44,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-362166101 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-362166101 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-362166101 |ULTIMATE.start_main_#t~ite28_Out-362166101|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-362166101|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-362166101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-362166101} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-362166101|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-362166101, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-362166101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:34:44,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In2127092100 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In2127092100 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2127092100 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2127092100 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out2127092100| ~y$r_buff1_thd0~0_In2127092100)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out2127092100| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127092100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127092100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127092100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127092100} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2127092100, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2127092100|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127092100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127092100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127092100} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:34:44,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2043379882 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2043379882 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In2043379882 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2043379882 256))) (= (mod ~y$w_buff0_used~0_In2043379882 256) 0))) (= |ULTIMATE.start_main_#t~ite38_Out2043379882| |ULTIMATE.start_main_#t~ite39_Out2043379882|) (= |ULTIMATE.start_main_#t~ite38_Out2043379882| ~y$w_buff1~0_In2043379882) .cse1) (and (= |ULTIMATE.start_main_#t~ite38_In2043379882| |ULTIMATE.start_main_#t~ite38_Out2043379882|) (not .cse1) (= ~y$w_buff1~0_In2043379882 |ULTIMATE.start_main_#t~ite39_Out2043379882|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2043379882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2043379882, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2043379882, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In2043379882|, ~weak$$choice2~0=~weak$$choice2~0_In2043379882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2043379882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2043379882, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2043379882, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2043379882|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2043379882, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2043379882|, ~weak$$choice2~0=~weak$$choice2~0_In2043379882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2043379882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2043379882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 22:34:44,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-928311897 256)))) (or (and (= ~y$w_buff0_used~0_In-928311897 |ULTIMATE.start_main_#t~ite42_Out-928311897|) (= |ULTIMATE.start_main_#t~ite41_In-928311897| |ULTIMATE.start_main_#t~ite41_Out-928311897|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-928311897 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-928311897 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-928311897 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-928311897 256)))) (= |ULTIMATE.start_main_#t~ite41_Out-928311897| ~y$w_buff0_used~0_In-928311897) .cse0 (= |ULTIMATE.start_main_#t~ite41_Out-928311897| |ULTIMATE.start_main_#t~ite42_Out-928311897|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-928311897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928311897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-928311897, ~weak$$choice2~0=~weak$$choice2~0_In-928311897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-928311897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-928311897|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928311897, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-928311897, ~weak$$choice2~0=~weak$$choice2~0_In-928311897, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-928311897|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-928311897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928311897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:34:44,303 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:34:44,305 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:34:44,305 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:34:44,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:34:44 BasicIcfg [2019-12-27 22:34:44,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:34:44,446 INFO L168 Benchmark]: Toolchain (without parser) took 86723.26 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 772.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,454 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.53 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.00 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,455 INFO L168 Benchmark]: Boogie Preprocessor took 41.26 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 152.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,456 INFO L168 Benchmark]: RCFGBuilder took 890.40 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 102.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,456 INFO L168 Benchmark]: TraceAbstraction took 84827.47 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 713.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:44,465 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.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 859.53 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 101.3 MB in the beginning and 157.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 99.00 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.26 ms. Allocated memory is still 204.5 MB. Free memory was 154.3 MB in the beginning and 152.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 890.40 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 102.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84827.47 ms. Allocated memory was 204.5 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 713.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 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(&t2186, ((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(&t2187, ((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(&t2188, ((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: 84.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3051 SDtfs, 5022 SDslu, 7600 SDs, 0 SdLazy, 6566 SolverSat, 402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 132 SyntacticMatches, 64 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 4.1s 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: 30.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 75124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 141655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...