/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/mix032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:55:36,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:55:36,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:55:36,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:55:36,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:55:36,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:55:36,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:55:36,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:55:36,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:55:36,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:55:36,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:55:36,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:55:36,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:55:36,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:55:36,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:55:36,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:55:36,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:55:36,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:55:36,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:55:36,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:55:36,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:55:36,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:55:36,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:55:36,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:55:36,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:55:36,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:55:36,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:55:36,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:55:36,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:55:36,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:55:36,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:55:36,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:55:36,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:55:36,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:55:36,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:55:36,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:55:36,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:55:36,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:55:36,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:55:36,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:55:36,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:55:36,411 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 20:55:36,446 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:55:36,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:55:36,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:55:36,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:55:36,448 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:55:36,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:55:36,448 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:55:36,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:55:36,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:55:36,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:55:36,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:55:36,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:55:36,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:55:36,449 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:55:36,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:55:36,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:55:36,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:55:36,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:55:36,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:55:36,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:55:36,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:55:36,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:55:36,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:55:36,453 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:55:36,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:55:36,454 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:55:36,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:55:36,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:55:36,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:55:36,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:55:36,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:55:36,761 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:55:36,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2019-12-27 20:55:36,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554eee87/1a120d7560a34074ad8f3d7e4679069b/FLAG498f88c94 [2019-12-27 20:55:37,398 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:55:37,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.opt.i [2019-12-27 20:55:37,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554eee87/1a120d7560a34074ad8f3d7e4679069b/FLAG498f88c94 [2019-12-27 20:55:37,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a554eee87/1a120d7560a34074ad8f3d7e4679069b [2019-12-27 20:55:37,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:55:37,651 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:55:37,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:37,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:55:37,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:55:37,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:37" (1/1) ... [2019-12-27 20:55:37,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:37, skipping insertion in model container [2019-12-27 20:55:37,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:55:37" (1/1) ... [2019-12-27 20:55:37,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:55:37,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:55:38,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:38,306 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:55:38,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:55:38,508 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:55:38,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38 WrapperNode [2019-12-27 20:55:38,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:55:38,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:38,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:55:38,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:55:38,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:55:38,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:55:38,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:55:38,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:55:38,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (1/1) ... [2019-12-27 20:55:38,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:55:38,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:55:38,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:55:38,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:55:38,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (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 20:55:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:55:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:55:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:55:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:55:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:55:38,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:55:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:55:38,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:55:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:55:38,760 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:55:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:55:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:55:38,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:55:38,762 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 20:55:39,463 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:55:39,464 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:55:39,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:39 BoogieIcfgContainer [2019-12-27 20:55:39,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:55:39,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:55:39,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:55:39,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:55:39,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:55:37" (1/3) ... [2019-12-27 20:55:39,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d2a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:39, skipping insertion in model container [2019-12-27 20:55:39,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:55:38" (2/3) ... [2019-12-27 20:55:39,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d2a83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:55:39, skipping insertion in model container [2019-12-27 20:55:39,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:55:39" (3/3) ... [2019-12-27 20:55:39,477 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.opt.i [2019-12-27 20:55:39,486 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:55:39,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:55:39,498 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:55:39,499 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:55:39,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,573 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,573 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,574 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,574 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,574 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,603 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,604 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,610 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:55:39,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:55:39,658 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:55:39,658 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:55:39,659 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:55:39,659 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:55:39,659 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:55:39,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:55:39,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:55:39,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:55:39,684 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-27 20:55:39,686 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-27 20:55:39,784 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-27 20:55:39,784 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:39,797 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:55:39,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-27 20:55:39,860 INFO L132 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-27 20:55:39,861 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:55:39,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/141 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:55:39,880 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 20:55:39,882 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:55:40,651 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 20:55:43,132 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:43,258 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:43,622 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 20:55:43,767 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 20:55:43,788 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51271 [2019-12-27 20:55:43,788 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 20:55:43,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-27 20:55:44,567 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-27 20:55:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-27 20:55:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:55:44,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:44,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:44,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:44,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1671700896, now seen corresponding path program 1 times [2019-12-27 20:55:44,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:44,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225389741] [2019-12-27 20:55:44,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:44,830 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 20:55:44,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225389741] [2019-12-27 20:55:44,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:44,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:55:44,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983164520] [2019-12-27 20:55:44,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:44,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:44,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:55:44,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:44,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:44,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:44,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:44,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:44,876 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-27 20:55:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:45,246 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-27 20:55:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:45,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:55:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:45,440 INFO L225 Difference]: With dead ends: 14182 [2019-12-27 20:55:45,441 INFO L226 Difference]: Without dead ends: 13350 [2019-12-27 20:55:45,442 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 20:55:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-27 20:55:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-27 20:55:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-27 20:55:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-27 20:55:46,274 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-27 20:55:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:46,275 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-27 20:55:46,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-27 20:55:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:55:46,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:46,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:46,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash -76146322, now seen corresponding path program 1 times [2019-12-27 20:55:46,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:46,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363751235] [2019-12-27 20:55:46,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:46,398 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 20:55:46,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363751235] [2019-12-27 20:55:46,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:46,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:46,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39268286] [2019-12-27 20:55:46,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:46,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:46,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:55:46,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:46,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:46,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:46,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:46,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:46,406 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 3 states. [2019-12-27 20:55:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:46,508 INFO L93 Difference]: Finished difference Result 7974 states and 27125 transitions. [2019-12-27 20:55:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:46,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:55:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:46,537 INFO L225 Difference]: With dead ends: 7974 [2019-12-27 20:55:46,537 INFO L226 Difference]: Without dead ends: 7974 [2019-12-27 20:55:46,538 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 20:55:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-27 20:55:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-27 20:55:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-27 20:55:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 27125 transitions. [2019-12-27 20:55:47,682 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 27125 transitions. Word has length 13 [2019-12-27 20:55:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:47,682 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 27125 transitions. [2019-12-27 20:55:47,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 27125 transitions. [2019-12-27 20:55:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:47,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:47,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:47,685 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash 383510487, now seen corresponding path program 1 times [2019-12-27 20:55:47,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:47,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734801877] [2019-12-27 20:55:47,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:47,737 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 20:55:47,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734801877] [2019-12-27 20:55:47,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:47,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:47,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [795951618] [2019-12-27 20:55:47,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:47,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:47,742 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 20:55:47,742 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:47,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:47,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:47,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:47,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:47,745 INFO L87 Difference]: Start difference. First operand 7974 states and 27125 transitions. Second operand 4 states. [2019-12-27 20:55:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:47,787 INFO L93 Difference]: Finished difference Result 1840 states and 5044 transitions. [2019-12-27 20:55:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:47,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:55:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:47,794 INFO L225 Difference]: With dead ends: 1840 [2019-12-27 20:55:47,794 INFO L226 Difference]: Without dead ends: 1840 [2019-12-27 20:55:47,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-12-27 20:55:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2019-12-27 20:55:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-12-27 20:55:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 5044 transitions. [2019-12-27 20:55:47,839 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 5044 transitions. Word has length 14 [2019-12-27 20:55:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:47,840 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 5044 transitions. [2019-12-27 20:55:47,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 5044 transitions. [2019-12-27 20:55:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:55:47,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:47,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:47,842 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1452926097, now seen corresponding path program 1 times [2019-12-27 20:55:47,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:47,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203472642] [2019-12-27 20:55:47,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:47,886 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 20:55:47,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203472642] [2019-12-27 20:55:47,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:47,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:47,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1328525008] [2019-12-27 20:55:47,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:47,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:47,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:55:47,894 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:47,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:47,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:47,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:47,896 INFO L87 Difference]: Start difference. First operand 1840 states and 5044 transitions. Second operand 3 states. [2019-12-27 20:55:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:47,977 INFO L93 Difference]: Finished difference Result 2653 states and 7081 transitions. [2019-12-27 20:55:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:47,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 20:55:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:47,986 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 20:55:47,987 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 20:55:47,987 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 20:55:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 20:55:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2071. [2019-12-27 20:55:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 20:55:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5594 transitions. [2019-12-27 20:55:48,045 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5594 transitions. Word has length 16 [2019-12-27 20:55:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:48,045 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 5594 transitions. [2019-12-27 20:55:48,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5594 transitions. [2019-12-27 20:55:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:55:48,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:48,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:48,047 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1583082976, now seen corresponding path program 1 times [2019-12-27 20:55:48,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:48,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150535255] [2019-12-27 20:55:48,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:48,116 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 20:55:48,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150535255] [2019-12-27 20:55:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:48,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300343318] [2019-12-27 20:55:48,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:48,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:48,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:55:48,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:48,124 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:48,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:48,125 INFO L87 Difference]: Start difference. First operand 2071 states and 5594 transitions. Second operand 4 states. [2019-12-27 20:55:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:48,296 INFO L93 Difference]: Finished difference Result 2647 states and 6980 transitions. [2019-12-27 20:55:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:48,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:55:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:48,305 INFO L225 Difference]: With dead ends: 2647 [2019-12-27 20:55:48,305 INFO L226 Difference]: Without dead ends: 2647 [2019-12-27 20:55:48,306 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 20:55:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-27 20:55:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2439. [2019-12-27 20:55:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2019-12-27 20:55:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 6530 transitions. [2019-12-27 20:55:48,364 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 6530 transitions. Word has length 16 [2019-12-27 20:55:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:48,365 INFO L462 AbstractCegarLoop]: Abstraction has 2439 states and 6530 transitions. [2019-12-27 20:55:48,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 6530 transitions. [2019-12-27 20:55:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:55:48,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:48,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:48,367 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash 427470360, now seen corresponding path program 1 times [2019-12-27 20:55:48,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:48,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266334835] [2019-12-27 20:55:48,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:48,413 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 20:55:48,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266334835] [2019-12-27 20:55:48,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:48,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:48,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [151942087] [2019-12-27 20:55:48,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:48,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:48,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:55:48,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:48,479 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:48,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:48,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:48,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:48,481 INFO L87 Difference]: Start difference. First operand 2439 states and 6530 transitions. Second operand 5 states. [2019-12-27 20:55:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:48,713 INFO L93 Difference]: Finished difference Result 3088 states and 8135 transitions. [2019-12-27 20:55:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:48,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:55:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:48,722 INFO L225 Difference]: With dead ends: 3088 [2019-12-27 20:55:48,722 INFO L226 Difference]: Without dead ends: 3088 [2019-12-27 20:55:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-12-27 20:55:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2576. [2019-12-27 20:55:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-12-27 20:55:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 6902 transitions. [2019-12-27 20:55:48,812 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 6902 transitions. Word has length 16 [2019-12-27 20:55:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:48,813 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 6902 transitions. [2019-12-27 20:55:48,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 6902 transitions. [2019-12-27 20:55:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:55:48,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:48,818 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] [2019-12-27 20:55:48,818 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 879756343, now seen corresponding path program 1 times [2019-12-27 20:55:48,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:48,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383621038] [2019-12-27 20:55:48,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:48,872 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 20:55:48,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383621038] [2019-12-27 20:55:48,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:48,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:55:48,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585825206] [2019-12-27 20:55:48,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:48,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:48,893 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 20:55:48,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:48,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:48,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:48,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:48,895 INFO L87 Difference]: Start difference. First operand 2576 states and 6902 transitions. Second operand 5 states. [2019-12-27 20:55:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:48,936 INFO L93 Difference]: Finished difference Result 1612 states and 4421 transitions. [2019-12-27 20:55:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:48,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 20:55:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:48,941 INFO L225 Difference]: With dead ends: 1612 [2019-12-27 20:55:48,941 INFO L226 Difference]: Without dead ends: 1612 [2019-12-27 20:55:48,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-27 20:55:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1512. [2019-12-27 20:55:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-12-27 20:55:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4171 transitions. [2019-12-27 20:55:48,973 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4171 transitions. Word has length 29 [2019-12-27 20:55:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:48,974 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 4171 transitions. [2019-12-27 20:55:48,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4171 transitions. [2019-12-27 20:55:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:48,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:48,978 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] [2019-12-27 20:55:48,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:48,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 266150348, now seen corresponding path program 1 times [2019-12-27 20:55:48,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:48,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246646159] [2019-12-27 20:55:48,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:49,070 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 20:55:49,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246646159] [2019-12-27 20:55:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:49,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826372440] [2019-12-27 20:55:49,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:49,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:49,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 143 transitions. [2019-12-27 20:55:49,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:49,131 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:49,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:49,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:49,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:49,136 INFO L87 Difference]: Start difference. First operand 1512 states and 4171 transitions. Second operand 5 states. [2019-12-27 20:55:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:49,203 INFO L93 Difference]: Finished difference Result 2240 states and 5797 transitions. [2019-12-27 20:55:49,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:55:49,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 20:55:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:49,208 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 20:55:49,208 INFO L226 Difference]: Without dead ends: 1473 [2019-12-27 20:55:49,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2019-12-27 20:55:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1369. [2019-12-27 20:55:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-12-27 20:55:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 3710 transitions. [2019-12-27 20:55:49,235 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 3710 transitions. Word has length 44 [2019-12-27 20:55:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:49,236 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 3710 transitions. [2019-12-27 20:55:49,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 3710 transitions. [2019-12-27 20:55:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:49,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:49,240 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] [2019-12-27 20:55:49,240 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash 790276266, now seen corresponding path program 2 times [2019-12-27 20:55:49,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:49,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359570636] [2019-12-27 20:55:49,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:49,316 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 20:55:49,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359570636] [2019-12-27 20:55:49,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:49,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:49,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393595857] [2019-12-27 20:55:49,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:49,330 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:49,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 151 transitions. [2019-12-27 20:55:49,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:49,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:49,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:49,394 INFO L87 Difference]: Start difference. First operand 1369 states and 3710 transitions. Second operand 5 states. [2019-12-27 20:55:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:49,587 INFO L93 Difference]: Finished difference Result 2329 states and 6105 transitions. [2019-12-27 20:55:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:55:49,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 20:55:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:49,590 INFO L225 Difference]: With dead ends: 2329 [2019-12-27 20:55:49,590 INFO L226 Difference]: Without dead ends: 763 [2019-12-27 20:55:49,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2019-12-27 20:55:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 490. [2019-12-27 20:55:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-27 20:55:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1117 transitions. [2019-12-27 20:55:49,622 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1117 transitions. Word has length 44 [2019-12-27 20:55:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:49,622 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1117 transitions. [2019-12-27 20:55:49,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1117 transitions. [2019-12-27 20:55:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:49,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:49,624 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] [2019-12-27 20:55:49,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1816574034, now seen corresponding path program 3 times [2019-12-27 20:55:49,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:49,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867974631] [2019-12-27 20:55:49,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:49,708 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 20:55:49,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867974631] [2019-12-27 20:55:49,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:49,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:49,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881422685] [2019-12-27 20:55:49,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:49,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:49,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 134 transitions. [2019-12-27 20:55:49,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:49,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:55:49,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:55:49,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:55:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:49,779 INFO L87 Difference]: Start difference. First operand 490 states and 1117 transitions. Second operand 7 states. [2019-12-27 20:55:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:49,965 INFO L93 Difference]: Finished difference Result 894 states and 1986 transitions. [2019-12-27 20:55:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:55:49,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 20:55:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:49,968 INFO L225 Difference]: With dead ends: 894 [2019-12-27 20:55:49,968 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 20:55:49,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:55:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 20:55:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 538. [2019-12-27 20:55:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-27 20:55:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1192 transitions. [2019-12-27 20:55:49,978 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1192 transitions. Word has length 44 [2019-12-27 20:55:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:49,979 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1192 transitions. [2019-12-27 20:55:49,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:55:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1192 transitions. [2019-12-27 20:55:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:49,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:49,980 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] [2019-12-27 20:55:49,981 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1698775532, now seen corresponding path program 4 times [2019-12-27 20:55:49,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:49,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475035994] [2019-12-27 20:55:49,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:50,066 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 20:55:50,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475035994] [2019-12-27 20:55:50,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:50,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:50,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971732803] [2019-12-27 20:55:50,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:50,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:50,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 151 transitions. [2019-12-27 20:55:50,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:50,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 20:55:50,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:50,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:50,162 INFO L87 Difference]: Start difference. First operand 538 states and 1192 transitions. Second operand 6 states. [2019-12-27 20:55:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:50,599 INFO L93 Difference]: Finished difference Result 870 states and 1883 transitions. [2019-12-27 20:55:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:50,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-27 20:55:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:50,606 INFO L225 Difference]: With dead ends: 870 [2019-12-27 20:55:50,606 INFO L226 Difference]: Without dead ends: 852 [2019-12-27 20:55:50,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-12-27 20:55:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 808. [2019-12-27 20:55:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 20:55:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1766 transitions. [2019-12-27 20:55:50,627 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1766 transitions. Word has length 44 [2019-12-27 20:55:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:50,628 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1766 transitions. [2019-12-27 20:55:50,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1766 transitions. [2019-12-27 20:55:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:50,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:50,635 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] [2019-12-27 20:55:50,636 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2098685651, now seen corresponding path program 1 times [2019-12-27 20:55:50,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:50,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339649227] [2019-12-27 20:55:50,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:55:50,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339649227] [2019-12-27 20:55:50,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:50,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:50,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806797447] [2019-12-27 20:55:50,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:50,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:50,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 109 transitions. [2019-12-27 20:55:50,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:50,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:55:50,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:50,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:50,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:50,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:50,815 INFO L87 Difference]: Start difference. First operand 808 states and 1766 transitions. Second operand 3 states. [2019-12-27 20:55:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:50,854 INFO L93 Difference]: Finished difference Result 920 states and 1868 transitions. [2019-12-27 20:55:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:50,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:55:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:50,857 INFO L225 Difference]: With dead ends: 920 [2019-12-27 20:55:50,857 INFO L226 Difference]: Without dead ends: 920 [2019-12-27 20:55:50,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-12-27 20:55:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 808. [2019-12-27 20:55:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 20:55:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1658 transitions. [2019-12-27 20:55:50,872 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1658 transitions. Word has length 44 [2019-12-27 20:55:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:50,873 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1658 transitions. [2019-12-27 20:55:50,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1658 transitions. [2019-12-27 20:55:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:55:50,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:50,875 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] [2019-12-27 20:55:50,876 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash 476211020, now seen corresponding path program 5 times [2019-12-27 20:55:50,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:50,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219109397] [2019-12-27 20:55:50,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:50,970 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 20:55:50,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219109397] [2019-12-27 20:55:50,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:50,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:50,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95034400] [2019-12-27 20:55:50,972 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:50,984 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:51,021 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 104 transitions. [2019-12-27 20:55:51,021 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:51,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:51,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:51,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:51,026 INFO L87 Difference]: Start difference. First operand 808 states and 1658 transitions. Second operand 3 states. [2019-12-27 20:55:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:51,038 INFO L93 Difference]: Finished difference Result 806 states and 1653 transitions. [2019-12-27 20:55:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:51,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:55:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:51,041 INFO L225 Difference]: With dead ends: 806 [2019-12-27 20:55:51,041 INFO L226 Difference]: Without dead ends: 806 [2019-12-27 20:55:51,041 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 20:55:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-27 20:55:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 665. [2019-12-27 20:55:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-27 20:55:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1386 transitions. [2019-12-27 20:55:51,053 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1386 transitions. Word has length 44 [2019-12-27 20:55:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:51,054 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 1386 transitions. [2019-12-27 20:55:51,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1386 transitions. [2019-12-27 20:55:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 20:55:51,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:51,056 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] [2019-12-27 20:55:51,056 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1501880967, now seen corresponding path program 1 times [2019-12-27 20:55:51,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:51,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348036812] [2019-12-27 20:55:51,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:51,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:55:51,239 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:55:51,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~a~0_8) (= 0 v_~z$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~z$w_buff1~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t858~0.base_24|)) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_ULTIMATE.start_main_~#t858~0.offset_19|) (= 0 v_~z$r_buff1_thd2~0_38) (= 0 v_~z$flush_delayed~0_14) (= v_~z~0_23 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t858~0.base_24|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~z$r_buff1_thd3~0_16) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_24|) |v_ULTIMATE.start_main_~#t858~0.offset_19| 0)) |v_#memory_int_17|) (= v_~z$w_buff0_used~0_95 0) (= v_~z$r_buff0_thd3~0_25 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t858~0.base_24| 4) |v_#length_25|) (= 0 v_~z$w_buff1_used~0_53) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= v_~z$r_buff0_thd2~0_66 0) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_16) (= v_~z$read_delayed_var~0.offset_8 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t858~0.base_24| 1)) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t858~0.offset=|v_ULTIMATE.start_main_~#t858~0.offset_19|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ULTIMATE.start_main_~#t858~0.base=|v_ULTIMATE.start_main_~#t858~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_23|, ~x~0=v_~x~0_12, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_20, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_66, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_16, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t858~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t858~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t860~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t860~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t859~0.base, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t859~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:55:51,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t859~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t859~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t859~0.offset_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t859~0.base_10| 4)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10|) |v_ULTIMATE.start_main_~#t859~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t859~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t859~0.base] because there is no mapped edge [2019-12-27 20:55:51,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t860~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t860~0.base_13|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t860~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t860~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13|) |v_ULTIMATE.start_main_~#t860~0.offset_11| 2))) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_13|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t860~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t860~0.offset, #length] because there is no mapped edge [2019-12-27 20:55:51,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0_#in~arg.offset_In947505073| P2Thread1of1ForFork0_~arg.offset_Out947505073) (= ~z$w_buff0~0_In947505073 ~z$w_buff1~0_Out947505073) (= (mod ~z$w_buff1_used~0_Out947505073 256) 0) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out947505073 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out947505073|) (= ~z$w_buff1_used~0_Out947505073 ~z$w_buff0_used~0_In947505073) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out947505073|) (= ~z$w_buff0_used~0_Out947505073 1) (= |P2Thread1of1ForFork0_#in~arg.base_In947505073| P2Thread1of1ForFork0_~arg.base_Out947505073) (= 1 ~z$w_buff0~0_Out947505073)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In947505073|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In947505073, ~z$w_buff0~0=~z$w_buff0~0_In947505073, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In947505073|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out947505073, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out947505073|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In947505073|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out947505073, ~z$w_buff0~0=~z$w_buff0~0_Out947505073, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out947505073, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out947505073, ~z$w_buff1~0=~z$w_buff1~0_Out947505073, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In947505073|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out947505073} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:55:51,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~b~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:55:51,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In283397084 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In283397084 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out283397084| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In283397084 |P2Thread1of1ForFork0_#t~ite28_Out283397084|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In283397084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In283397084} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out283397084|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In283397084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In283397084} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:55:51,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In276886032 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In276886032 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In276886032 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In276886032 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In276886032 |P2Thread1of1ForFork0_#t~ite29_Out276886032|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite29_Out276886032|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In276886032, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In276886032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In276886032, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In276886032} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In276886032, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In276886032, ~z$w_buff1_used~0=~z$w_buff1_used~0_In276886032, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In276886032, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out276886032|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:55:51,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1058672373 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1058672373 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_Out-1058672373 ~z$r_buff0_thd3~0_In-1058672373)) (and (not .cse0) (= ~z$r_buff0_thd3~0_Out-1058672373 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058672373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1058672373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1058672373, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1058672373, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1058672373|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-27 20:55:51,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1668106037 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1668106037 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1668106037 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1668106037 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1668106037 |P2Thread1of1ForFork0_#t~ite31_Out1668106037|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite31_Out1668106037|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1668106037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1668106037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1668106037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1668106037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1668106037, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1668106037, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1668106037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1668106037, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out1668106037|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 20:55:51,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_11 |v_P2Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:55:51,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff0_thd2~0_57) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_10|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_12|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:55:51,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_13 v_~z$mem_tmp~0_4) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:55:51,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:55:51,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1488501046 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1488501046 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1488501046| ~z~0_In1488501046)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1488501046| ~z$w_buff1~0_In1488501046) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1488501046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1488501046, ~z$w_buff1~0=~z$w_buff1~0_In1488501046, ~z~0=~z~0_In1488501046} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1488501046, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1488501046|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1488501046, ~z$w_buff1~0=~z$w_buff1~0_In1488501046, ~z~0=~z~0_In1488501046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 20:55:51,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-27 20:55:51,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-863310084 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-863310084 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-863310084|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-863310084| ~z$w_buff0_used~0_In-863310084)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-863310084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-863310084} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-863310084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-863310084, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-863310084|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:55:51,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1432644851 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1432644851 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1432644851 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1432644851 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1432644851| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out1432644851| ~z$w_buff1_used~0_In1432644851)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1432644851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432644851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1432644851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432644851} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1432644851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432644851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1432644851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432644851, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1432644851|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:55:51,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2046591142 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2046591142 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-2046591142|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-2046591142 |ULTIMATE.start_main_#t~ite39_Out-2046591142|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046591142, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046591142} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2046591142, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2046591142|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2046591142} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:55:51,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1820800764 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1820800764 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1820800764 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1820800764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1820800764|)) (and (= ~z$r_buff1_thd0~0_In-1820800764 |ULTIMATE.start_main_#t~ite40_Out-1820800764|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1820800764, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820800764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1820800764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820800764} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1820800764, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1820800764|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1820800764, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1820800764, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1820800764} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:55:51,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_#t~ite40_16| v_~z$r_buff1_thd0~0_14) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 1 v_~__unbuffered_p2_EAX~0_10) (= 1 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:55:51,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:55:51 BasicIcfg [2019-12-27 20:55:51,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:55:51,386 INFO L168 Benchmark]: Toolchain (without parser) took 13735.74 ms. Allocated memory was 146.8 MB in the beginning and 702.5 MB in the end (delta: 555.7 MB). Free memory was 103.6 MB in the beginning and 364.6 MB in the end (delta: -261.0 MB). Peak memory consumption was 294.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,388 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.13 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.2 MB in the beginning and 160.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.28 ms. Allocated memory is still 205.5 MB. Free memory was 159.5 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,394 INFO L168 Benchmark]: Boogie Preprocessor took 70.21 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,394 INFO L168 Benchmark]: RCFGBuilder took 786.65 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,395 INFO L168 Benchmark]: TraceAbstraction took 11917.49 ms. Allocated memory was 205.5 MB in the beginning and 702.5 MB in the end (delta: 497.0 MB). Free memory was 110.7 MB in the beginning and 364.6 MB in the end (delta: -253.9 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:51,398 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.25 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 857.13 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 103.2 MB in the beginning and 160.2 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.28 ms. Allocated memory is still 205.5 MB. Free memory was 159.5 MB in the beginning and 157.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.21 ms. Allocated memory is still 205.5 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.65 ms. Allocated memory is still 205.5 MB. Free memory was 155.0 MB in the beginning and 110.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11917.49 ms. Allocated memory was 205.5 MB in the beginning and 702.5 MB in the end (delta: 497.0 MB). Free memory was 110.7 MB in the beginning and 364.6 MB in the end (delta: -253.9 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 19 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 127 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51271 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1506 SDtfs, 1304 SDslu, 2479 SDs, 0 SdLazy, 986 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14534occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 2144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 36148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...