/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:19:45,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:19:45,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:19:45,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:19:45,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:19:45,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:19:45,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:19:45,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:19:45,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:19:45,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:19:45,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:19:45,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:19:45,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:19:45,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:19:45,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:19:45,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:19:45,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:19:45,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:19:45,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:19:45,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:19:45,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:19:45,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:19:45,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:19:45,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:19:45,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:19:45,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:19:45,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:19:45,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:19:45,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:19:45,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:19:45,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:19:45,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:19:45,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:19:45,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:19:45,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:19:45,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:19:45,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:19:45,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:19:45,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:19:45,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:19:45,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:19:45,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:19:45,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:19:45,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:19:45,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:19:45,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:19:45,476 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:19:45,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:19:45,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:19:45,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:19:45,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:19:45,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:19:45,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:19:45,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:19:45,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:19:45,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:19:45,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:19:45,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:19:45,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:19:45,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:19:45,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:19:45,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:19:45,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:19:45,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:19:45,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:19:45,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:19:45,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:19:45,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:19:45,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:19:45,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:19:45,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:19:45,802 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:19:45,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-18 20:19:45,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9ae22e1/cfca58cf606341fa9cb5572ce07c0fa0/FLAGb632f5a96 [2019-12-18 20:19:46,360 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:19:46,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_tso.opt.i [2019-12-18 20:19:46,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9ae22e1/cfca58cf606341fa9cb5572ce07c0fa0/FLAGb632f5a96 [2019-12-18 20:19:46,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9ae22e1/cfca58cf606341fa9cb5572ce07c0fa0 [2019-12-18 20:19:46,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:19:46,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:19:46,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:46,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:19:46,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:19:46,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:46" (1/1) ... [2019-12-18 20:19:46,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79920931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:46, skipping insertion in model container [2019-12-18 20:19:46,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:19:46" (1/1) ... [2019-12-18 20:19:46,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:19:46,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:19:47,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:47,330 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:19:47,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:19:47,490 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:19:47,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47 WrapperNode [2019-12-18 20:19:47,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:19:47,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:47,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:19:47,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:19:47,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:19:47,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:19:47,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:19:47,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:19:47,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... [2019-12-18 20:19:47,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:19:47,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:19:47,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:19:47,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:19:47,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:19:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:19:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:19:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:19:47,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:19:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:19:47,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:19:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:19:47,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:19:47,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:19:47,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:19:47,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:19:47,710 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:19:48,528 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:19:48,529 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:19:48,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:48 BoogieIcfgContainer [2019-12-18 20:19:48,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:19:48,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:19:48,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:19:48,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:19:48,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:19:46" (1/3) ... [2019-12-18 20:19:48,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790ea16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:48, skipping insertion in model container [2019-12-18 20:19:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:19:47" (2/3) ... [2019-12-18 20:19:48,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@790ea16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:19:48, skipping insertion in model container [2019-12-18 20:19:48,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:19:48" (3/3) ... [2019-12-18 20:19:48,538 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.opt.i [2019-12-18 20:19:48,563 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:19:48,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:19:48,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:19:48,571 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:19:48,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,659 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,666 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,667 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:19:48,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:19:48,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:19:48,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:19:48,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:19:48,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:19:48,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:19:48,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:19:48,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:19:48,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:19:48,723 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-18 20:19:48,725 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 20:19:48,818 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 20:19:48,818 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:48,842 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 20:19:48,877 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-18 20:19:48,929 INFO L126 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-18 20:19:48,930 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:19:48,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-18 20:19:48,972 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-18 20:19:48,973 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:19:51,939 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 20:19:52,353 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 20:19:52,467 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 20:19:52,515 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131854 [2019-12-18 20:19:52,515 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 20:19:52,519 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 132 transitions [2019-12-18 20:19:54,131 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26534 states. [2019-12-18 20:19:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 26534 states. [2019-12-18 20:19:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:19:54,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:54,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:19:54,141 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash 953057354, now seen corresponding path program 1 times [2019-12-18 20:19:54,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:54,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249936202] [2019-12-18 20:19:54,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:19:54,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249936202] [2019-12-18 20:19:54,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:54,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:19:54,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139360029] [2019-12-18 20:19:54,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:19:54,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:19:54,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:54,382 INFO L87 Difference]: Start difference. First operand 26534 states. Second operand 3 states. [2019-12-18 20:19:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:55,019 INFO L93 Difference]: Finished difference Result 26194 states and 94183 transitions. [2019-12-18 20:19:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:19:55,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:19:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:55,262 INFO L225 Difference]: With dead ends: 26194 [2019-12-18 20:19:55,263 INFO L226 Difference]: Without dead ends: 24502 [2019-12-18 20:19:55,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:19:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24502 states. [2019-12-18 20:19:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24502 to 24502. [2019-12-18 20:19:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24502 states. [2019-12-18 20:19:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24502 states to 24502 states and 88039 transitions. [2019-12-18 20:19:57,463 INFO L78 Accepts]: Start accepts. Automaton has 24502 states and 88039 transitions. Word has length 5 [2019-12-18 20:19:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:19:57,464 INFO L462 AbstractCegarLoop]: Abstraction has 24502 states and 88039 transitions. [2019-12-18 20:19:57,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:19:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 24502 states and 88039 transitions. [2019-12-18 20:19:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:19:57,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:19:57,467 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:19:57,468 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:19:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:19:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1380440387, now seen corresponding path program 1 times [2019-12-18 20:19:57,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:19:57,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407649147] [2019-12-18 20:19:57,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:19:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:19:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:19:57,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407649147] [2019-12-18 20:19:57,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:19:57,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:19:57,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807580455] [2019-12-18 20:19:57,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:19:57,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:19:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:19:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:19:57,578 INFO L87 Difference]: Start difference. First operand 24502 states and 88039 transitions. Second operand 4 states. [2019-12-18 20:19:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:19:58,331 INFO L93 Difference]: Finished difference Result 37826 states and 129915 transitions. [2019-12-18 20:19:58,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:19:58,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:19:58,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:19:58,485 INFO L225 Difference]: With dead ends: 37826 [2019-12-18 20:19:58,485 INFO L226 Difference]: Without dead ends: 37810 [2019-12-18 20:19:58,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37810 states. [2019-12-18 20:20:01,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37810 to 36886. [2019-12-18 20:20:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36886 states. [2019-12-18 20:20:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36886 states to 36886 states and 127503 transitions. [2019-12-18 20:20:01,220 INFO L78 Accepts]: Start accepts. Automaton has 36886 states and 127503 transitions. Word has length 11 [2019-12-18 20:20:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:01,221 INFO L462 AbstractCegarLoop]: Abstraction has 36886 states and 127503 transitions. [2019-12-18 20:20:01,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:20:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 36886 states and 127503 transitions. [2019-12-18 20:20:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:20:01,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:01,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:01,232 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2090130903, now seen corresponding path program 1 times [2019-12-18 20:20:01,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:01,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201853892] [2019-12-18 20:20:01,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:01,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201853892] [2019-12-18 20:20:01,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:01,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:20:01,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664716377] [2019-12-18 20:20:01,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:20:01,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:01,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:20:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:20:01,339 INFO L87 Difference]: Start difference. First operand 36886 states and 127503 transitions. Second operand 4 states. [2019-12-18 20:20:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:01,818 INFO L93 Difference]: Finished difference Result 46955 states and 159667 transitions. [2019-12-18 20:20:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:20:01,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:20:01,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:01,999 INFO L225 Difference]: With dead ends: 46955 [2019-12-18 20:20:01,999 INFO L226 Difference]: Without dead ends: 46941 [2019-12-18 20:20:01,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46941 states. [2019-12-18 20:20:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46941 to 42372. [2019-12-18 20:20:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42372 states. [2019-12-18 20:20:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42372 states to 42372 states and 145521 transitions. [2019-12-18 20:20:04,128 INFO L78 Accepts]: Start accepts. Automaton has 42372 states and 145521 transitions. Word has length 14 [2019-12-18 20:20:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:04,128 INFO L462 AbstractCegarLoop]: Abstraction has 42372 states and 145521 transitions. [2019-12-18 20:20:04,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:20:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42372 states and 145521 transitions. [2019-12-18 20:20:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:20:04,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:04,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:04,134 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash -369520138, now seen corresponding path program 1 times [2019-12-18 20:20:04,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:04,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299335973] [2019-12-18 20:20:04,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:04,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299335973] [2019-12-18 20:20:04,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:04,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:04,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241142460] [2019-12-18 20:20:04,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:20:04,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:20:04,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:04,191 INFO L87 Difference]: Start difference. First operand 42372 states and 145521 transitions. Second operand 3 states. [2019-12-18 20:20:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:04,510 INFO L93 Difference]: Finished difference Result 70468 states and 231072 transitions. [2019-12-18 20:20:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:20:04,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:20:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:04,674 INFO L225 Difference]: With dead ends: 70468 [2019-12-18 20:20:04,674 INFO L226 Difference]: Without dead ends: 70468 [2019-12-18 20:20:04,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70468 states. [2019-12-18 20:20:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70468 to 62872. [2019-12-18 20:20:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62872 states. [2019-12-18 20:20:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62872 states to 62872 states and 209460 transitions. [2019-12-18 20:20:08,046 INFO L78 Accepts]: Start accepts. Automaton has 62872 states and 209460 transitions. Word has length 15 [2019-12-18 20:20:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:08,046 INFO L462 AbstractCegarLoop]: Abstraction has 62872 states and 209460 transitions. [2019-12-18 20:20:08,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:20:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 62872 states and 209460 transitions. [2019-12-18 20:20:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:20:08,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:08,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:08,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:08,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:08,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1639009254, now seen corresponding path program 1 times [2019-12-18 20:20:08,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:08,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192741237] [2019-12-18 20:20:08,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:08,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192741237] [2019-12-18 20:20:08,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:08,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:20:08,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119271595] [2019-12-18 20:20:08,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:20:08,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:20:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:08,108 INFO L87 Difference]: Start difference. First operand 62872 states and 209460 transitions. Second operand 3 states. [2019-12-18 20:20:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:08,851 INFO L93 Difference]: Finished difference Result 59416 states and 197713 transitions. [2019-12-18 20:20:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:20:08,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:20:08,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:09,016 INFO L225 Difference]: With dead ends: 59416 [2019-12-18 20:20:09,016 INFO L226 Difference]: Without dead ends: 59093 [2019-12-18 20:20:09,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59093 states. [2019-12-18 20:20:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59093 to 59093. [2019-12-18 20:20:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59093 states. [2019-12-18 20:20:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59093 states to 59093 states and 196717 transitions. [2019-12-18 20:20:12,320 INFO L78 Accepts]: Start accepts. Automaton has 59093 states and 196717 transitions. Word has length 16 [2019-12-18 20:20:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:12,321 INFO L462 AbstractCegarLoop]: Abstraction has 59093 states and 196717 transitions. [2019-12-18 20:20:12,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:20:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 59093 states and 196717 transitions. [2019-12-18 20:20:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 20:20:12,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:12,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:12,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2035304780, now seen corresponding path program 1 times [2019-12-18 20:20:12,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:12,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122956274] [2019-12-18 20:20:12,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:12,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122956274] [2019-12-18 20:20:12,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:12,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:20:12,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323939391] [2019-12-18 20:20:12,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:20:12,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:20:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:20:12,387 INFO L87 Difference]: Start difference. First operand 59093 states and 196717 transitions. Second operand 4 states. [2019-12-18 20:20:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:12,958 INFO L93 Difference]: Finished difference Result 72866 states and 238915 transitions. [2019-12-18 20:20:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:20:12,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 20:20:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:13,090 INFO L225 Difference]: With dead ends: 72866 [2019-12-18 20:20:13,090 INFO L226 Difference]: Without dead ends: 72849 [2019-12-18 20:20:13,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72849 states. [2019-12-18 20:20:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72849 to 59871. [2019-12-18 20:20:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59871 states. [2019-12-18 20:20:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59871 states to 59871 states and 199251 transitions. [2019-12-18 20:20:14,912 INFO L78 Accepts]: Start accepts. Automaton has 59871 states and 199251 transitions. Word has length 17 [2019-12-18 20:20:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:14,912 INFO L462 AbstractCegarLoop]: Abstraction has 59871 states and 199251 transitions. [2019-12-18 20:20:14,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:20:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 59871 states and 199251 transitions. [2019-12-18 20:20:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 20:20:14,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:14,925 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] [2019-12-18 20:20:14,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -610432844, now seen corresponding path program 1 times [2019-12-18 20:20:14,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:14,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547147080] [2019-12-18 20:20:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:15,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547147080] [2019-12-18 20:20:15,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:15,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:20:15,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572979333] [2019-12-18 20:20:15,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:20:15,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:20:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:20:15,028 INFO L87 Difference]: Start difference. First operand 59871 states and 199251 transitions. Second operand 6 states. [2019-12-18 20:20:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:17,451 INFO L93 Difference]: Finished difference Result 88744 states and 287632 transitions. [2019-12-18 20:20:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:20:17,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-12-18 20:20:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:17,613 INFO L225 Difference]: With dead ends: 88744 [2019-12-18 20:20:17,613 INFO L226 Difference]: Without dead ends: 88735 [2019-12-18 20:20:17,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:20:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88735 states. [2019-12-18 20:20:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88735 to 64025. [2019-12-18 20:20:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64025 states. [2019-12-18 20:20:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64025 states to 64025 states and 212335 transitions. [2019-12-18 20:20:19,382 INFO L78 Accepts]: Start accepts. Automaton has 64025 states and 212335 transitions. Word has length 20 [2019-12-18 20:20:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:19,382 INFO L462 AbstractCegarLoop]: Abstraction has 64025 states and 212335 transitions. [2019-12-18 20:20:19,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:20:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 64025 states and 212335 transitions. [2019-12-18 20:20:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 20:20:19,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:19,401 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] [2019-12-18 20:20:19,401 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash -217091173, now seen corresponding path program 1 times [2019-12-18 20:20:19,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:19,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022868816] [2019-12-18 20:20:19,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:19,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022868816] [2019-12-18 20:20:19,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:19,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:19,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085452923] [2019-12-18 20:20:19,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:20:19,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:19,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:20:19,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:20:19,468 INFO L87 Difference]: Start difference. First operand 64025 states and 212335 transitions. Second operand 4 states. [2019-12-18 20:20:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:19,536 INFO L93 Difference]: Finished difference Result 11953 states and 32089 transitions. [2019-12-18 20:20:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:20:19,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 20:20:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:19,545 INFO L225 Difference]: With dead ends: 11953 [2019-12-18 20:20:19,545 INFO L226 Difference]: Without dead ends: 7401 [2019-12-18 20:20:19,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7401 states. [2019-12-18 20:20:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7401 to 7353. [2019-12-18 20:20:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7353 states. [2019-12-18 20:20:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7353 states to 7353 states and 17097 transitions. [2019-12-18 20:20:19,621 INFO L78 Accepts]: Start accepts. Automaton has 7353 states and 17097 transitions. Word has length 23 [2019-12-18 20:20:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:19,621 INFO L462 AbstractCegarLoop]: Abstraction has 7353 states and 17097 transitions. [2019-12-18 20:20:19,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:20:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7353 states and 17097 transitions. [2019-12-18 20:20:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 20:20:19,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:19,626 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] [2019-12-18 20:20:19,626 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1288158756, now seen corresponding path program 1 times [2019-12-18 20:20:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:19,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806842165] [2019-12-18 20:20:19,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:19,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806842165] [2019-12-18 20:20:19,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:19,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:19,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665591262] [2019-12-18 20:20:19,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:20:19,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:19,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:20:19,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:19,673 INFO L87 Difference]: Start difference. First operand 7353 states and 17097 transitions. Second operand 3 states. [2019-12-18 20:20:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:19,748 INFO L93 Difference]: Finished difference Result 8012 states and 17620 transitions. [2019-12-18 20:20:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:20:19,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-18 20:20:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:19,756 INFO L225 Difference]: With dead ends: 8012 [2019-12-18 20:20:19,756 INFO L226 Difference]: Without dead ends: 8012 [2019-12-18 20:20:19,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2019-12-18 20:20:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 7410. [2019-12-18 20:20:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7410 states. [2019-12-18 20:20:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7410 states to 7410 states and 16371 transitions. [2019-12-18 20:20:19,833 INFO L78 Accepts]: Start accepts. Automaton has 7410 states and 16371 transitions. Word has length 31 [2019-12-18 20:20:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:19,834 INFO L462 AbstractCegarLoop]: Abstraction has 7410 states and 16371 transitions. [2019-12-18 20:20:19,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:20:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7410 states and 16371 transitions. [2019-12-18 20:20:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:20:19,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:19,840 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] [2019-12-18 20:20:19,840 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1169223524, now seen corresponding path program 1 times [2019-12-18 20:20:19,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:19,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964724838] [2019-12-18 20:20:19,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:19,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964724838] [2019-12-18 20:20:19,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:19,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:19,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453442124] [2019-12-18 20:20:19,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:20:19,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:20:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:19,911 INFO L87 Difference]: Start difference. First operand 7410 states and 16371 transitions. Second operand 5 states. [2019-12-18 20:20:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:20,303 INFO L93 Difference]: Finished difference Result 8333 states and 18130 transitions. [2019-12-18 20:20:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:20:20,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 20:20:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:20,314 INFO L225 Difference]: With dead ends: 8333 [2019-12-18 20:20:20,314 INFO L226 Difference]: Without dead ends: 8332 [2019-12-18 20:20:20,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:20:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8332 states. [2019-12-18 20:20:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8332 to 6560. [2019-12-18 20:20:20,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6560 states. [2019-12-18 20:20:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 14652 transitions. [2019-12-18 20:20:20,386 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 14652 transitions. Word has length 34 [2019-12-18 20:20:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:20,387 INFO L462 AbstractCegarLoop]: Abstraction has 6560 states and 14652 transitions. [2019-12-18 20:20:20,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:20:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 14652 transitions. [2019-12-18 20:20:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:20:20,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:20,393 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] [2019-12-18 20:20:20,394 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:20,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -199933436, now seen corresponding path program 1 times [2019-12-18 20:20:20,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:20,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121971029] [2019-12-18 20:20:20,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:20,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121971029] [2019-12-18 20:20:20,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:20,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:20,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651347987] [2019-12-18 20:20:20,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:20:20,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:20,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:20:20,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:20,466 INFO L87 Difference]: Start difference. First operand 6560 states and 14652 transitions. Second operand 5 states. [2019-12-18 20:20:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:20,583 INFO L93 Difference]: Finished difference Result 9722 states and 21825 transitions. [2019-12-18 20:20:20,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:20:20,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:20:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:20,591 INFO L225 Difference]: With dead ends: 9722 [2019-12-18 20:20:20,591 INFO L226 Difference]: Without dead ends: 7826 [2019-12-18 20:20:20,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:20:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2019-12-18 20:20:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7826. [2019-12-18 20:20:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7826 states. [2019-12-18 20:20:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 17599 transitions. [2019-12-18 20:20:20,850 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 17599 transitions. Word has length 41 [2019-12-18 20:20:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:20,850 INFO L462 AbstractCegarLoop]: Abstraction has 7826 states and 17599 transitions. [2019-12-18 20:20:20,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:20:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 17599 transitions. [2019-12-18 20:20:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:20:20,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:20,859 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] [2019-12-18 20:20:20,859 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash 729473288, now seen corresponding path program 1 times [2019-12-18 20:20:20,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:20,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284009441] [2019-12-18 20:20:20,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:20,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284009441] [2019-12-18 20:20:20,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:20,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:20:20,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010473147] [2019-12-18 20:20:20,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:20:20,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:20,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:20:20,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:20,939 INFO L87 Difference]: Start difference. First operand 7826 states and 17599 transitions. Second operand 5 states. [2019-12-18 20:20:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:21,392 INFO L93 Difference]: Finished difference Result 8963 states and 19900 transitions. [2019-12-18 20:20:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:20:21,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 20:20:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:21,403 INFO L225 Difference]: With dead ends: 8963 [2019-12-18 20:20:21,403 INFO L226 Difference]: Without dead ends: 8963 [2019-12-18 20:20:21,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:20:21,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8963 states. [2019-12-18 20:20:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8963 to 8604. [2019-12-18 20:20:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2019-12-18 20:20:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 19202 transitions. [2019-12-18 20:20:21,495 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 19202 transitions. Word has length 42 [2019-12-18 20:20:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:21,495 INFO L462 AbstractCegarLoop]: Abstraction has 8604 states and 19202 transitions. [2019-12-18 20:20:21,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:20:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 19202 transitions. [2019-12-18 20:20:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:20:21,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:21,505 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] [2019-12-18 20:20:21,505 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1524647087, now seen corresponding path program 1 times [2019-12-18 20:20:21,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:21,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855256405] [2019-12-18 20:20:21,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:21,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855256405] [2019-12-18 20:20:21,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:21,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:20:21,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669399006] [2019-12-18 20:20:21,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:20:21,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:21,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:20:21,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:21,590 INFO L87 Difference]: Start difference. First operand 8604 states and 19202 transitions. Second operand 5 states. [2019-12-18 20:20:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:22,010 INFO L93 Difference]: Finished difference Result 9511 states and 20869 transitions. [2019-12-18 20:20:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:20:22,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 20:20:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:22,020 INFO L225 Difference]: With dead ends: 9511 [2019-12-18 20:20:22,020 INFO L226 Difference]: Without dead ends: 9511 [2019-12-18 20:20:22,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:20:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9511 states. [2019-12-18 20:20:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9511 to 8574. [2019-12-18 20:20:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8574 states. [2019-12-18 20:20:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 18758 transitions. [2019-12-18 20:20:22,109 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 18758 transitions. Word has length 43 [2019-12-18 20:20:22,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:22,109 INFO L462 AbstractCegarLoop]: Abstraction has 8574 states and 18758 transitions. [2019-12-18 20:20:22,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:20:22,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 18758 transitions. [2019-12-18 20:20:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:20:22,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:22,118 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] [2019-12-18 20:20:22,118 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash 4854504, now seen corresponding path program 1 times [2019-12-18 20:20:22,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:22,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550899600] [2019-12-18 20:20:22,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:22,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550899600] [2019-12-18 20:20:22,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:22,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:20:22,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444108060] [2019-12-18 20:20:22,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:20:22,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:20:22,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:22,201 INFO L87 Difference]: Start difference. First operand 8574 states and 18758 transitions. Second operand 5 states. [2019-12-18 20:20:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:22,262 INFO L93 Difference]: Finished difference Result 5730 states and 12417 transitions. [2019-12-18 20:20:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:20:22,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 20:20:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:22,269 INFO L225 Difference]: With dead ends: 5730 [2019-12-18 20:20:22,269 INFO L226 Difference]: Without dead ends: 5403 [2019-12-18 20:20:22,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:20:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-18 20:20:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5124. [2019-12-18 20:20:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-12-18 20:20:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 11217 transitions. [2019-12-18 20:20:22,344 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 11217 transitions. Word has length 43 [2019-12-18 20:20:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:22,347 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 11217 transitions. [2019-12-18 20:20:22,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:20:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 11217 transitions. [2019-12-18 20:20:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:20:22,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:22,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:22,353 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash 664606617, now seen corresponding path program 1 times [2019-12-18 20:20:22,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:22,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396011040] [2019-12-18 20:20:22,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:22,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396011040] [2019-12-18 20:20:22,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:22,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:20:22,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133305068] [2019-12-18 20:20:22,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:20:22,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:20:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:20:22,434 INFO L87 Difference]: Start difference. First operand 5124 states and 11217 transitions. Second operand 4 states. [2019-12-18 20:20:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:22,463 INFO L93 Difference]: Finished difference Result 5956 states and 12941 transitions. [2019-12-18 20:20:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:20:22,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-18 20:20:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:22,465 INFO L225 Difference]: With dead ends: 5956 [2019-12-18 20:20:22,465 INFO L226 Difference]: Without dead ends: 901 [2019-12-18 20:20:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:20:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-18 20:20:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2019-12-18 20:20:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-12-18 20:20:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1817 transitions. [2019-12-18 20:20:22,477 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1817 transitions. Word has length 59 [2019-12-18 20:20:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:22,477 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1817 transitions. [2019-12-18 20:20:22,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:20:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1817 transitions. [2019-12-18 20:20:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:20:22,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:22,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:22,479 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1824485506, now seen corresponding path program 1 times [2019-12-18 20:20:22,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:22,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476237221] [2019-12-18 20:20:22,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:22,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476237221] [2019-12-18 20:20:22,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:22,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:20:22,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112912797] [2019-12-18 20:20:22,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:20:22,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:20:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:20:22,583 INFO L87 Difference]: Start difference. First operand 901 states and 1817 transitions. Second operand 8 states. [2019-12-18 20:20:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:22,864 INFO L93 Difference]: Finished difference Result 1857 states and 3578 transitions. [2019-12-18 20:20:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:20:22,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-18 20:20:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:22,866 INFO L225 Difference]: With dead ends: 1857 [2019-12-18 20:20:22,866 INFO L226 Difference]: Without dead ends: 1326 [2019-12-18 20:20:22,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:20:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-18 20:20:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 952. [2019-12-18 20:20:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-18 20:20:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1893 transitions. [2019-12-18 20:20:22,877 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1893 transitions. Word has length 59 [2019-12-18 20:20:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:22,878 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1893 transitions. [2019-12-18 20:20:22,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:20:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1893 transitions. [2019-12-18 20:20:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:20:22,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:22,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:22,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1605661378, now seen corresponding path program 2 times [2019-12-18 20:20:22,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:22,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096406323] [2019-12-18 20:20:22,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:23,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096406323] [2019-12-18 20:20:23,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:23,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:20:23,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697521271] [2019-12-18 20:20:23,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:20:23,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:23,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:20:23,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:20:23,045 INFO L87 Difference]: Start difference. First operand 952 states and 1893 transitions. Second operand 9 states. [2019-12-18 20:20:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:23,543 INFO L93 Difference]: Finished difference Result 1470 states and 2832 transitions. [2019-12-18 20:20:23,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:20:23,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-12-18 20:20:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:23,545 INFO L225 Difference]: With dead ends: 1470 [2019-12-18 20:20:23,545 INFO L226 Difference]: Without dead ends: 1470 [2019-12-18 20:20:23,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:20:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-12-18 20:20:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 961. [2019-12-18 20:20:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2019-12-18 20:20:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1911 transitions. [2019-12-18 20:20:23,556 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1911 transitions. Word has length 59 [2019-12-18 20:20:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:23,556 INFO L462 AbstractCegarLoop]: Abstraction has 961 states and 1911 transitions. [2019-12-18 20:20:23,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:20:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1911 transitions. [2019-12-18 20:20:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:20:23,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:23,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:23,558 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash 695697502, now seen corresponding path program 3 times [2019-12-18 20:20:23,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:23,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727794661] [2019-12-18 20:20:23,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:23,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727794661] [2019-12-18 20:20:23,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:23,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:20:23,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568268418] [2019-12-18 20:20:23,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:20:23,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:23,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:20:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:20:23,638 INFO L87 Difference]: Start difference. First operand 961 states and 1911 transitions. Second operand 6 states. [2019-12-18 20:20:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:24,119 INFO L93 Difference]: Finished difference Result 1170 states and 2280 transitions. [2019-12-18 20:20:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:20:24,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-18 20:20:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:24,121 INFO L225 Difference]: With dead ends: 1170 [2019-12-18 20:20:24,121 INFO L226 Difference]: Without dead ends: 1170 [2019-12-18 20:20:24,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:20:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-18 20:20:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 991. [2019-12-18 20:20:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-18 20:20:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1966 transitions. [2019-12-18 20:20:24,134 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1966 transitions. Word has length 59 [2019-12-18 20:20:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:24,135 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1966 transitions. [2019-12-18 20:20:24,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:20:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1966 transitions. [2019-12-18 20:20:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:20:24,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:24,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:24,139 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1043077686, now seen corresponding path program 4 times [2019-12-18 20:20:24,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:24,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930212226] [2019-12-18 20:20:24,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:20:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:20:24,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930212226] [2019-12-18 20:20:24,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:20:24,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:20:24,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238107890] [2019-12-18 20:20:24,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:20:24,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:20:24,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:20:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:24,244 INFO L87 Difference]: Start difference. First operand 991 states and 1966 transitions. Second operand 3 states. [2019-12-18 20:20:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:20:24,258 INFO L93 Difference]: Finished difference Result 990 states and 1964 transitions. [2019-12-18 20:20:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:20:24,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 20:20:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:20:24,260 INFO L225 Difference]: With dead ends: 990 [2019-12-18 20:20:24,261 INFO L226 Difference]: Without dead ends: 990 [2019-12-18 20:20:24,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:20:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-18 20:20:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 847. [2019-12-18 20:20:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-18 20:20:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1701 transitions. [2019-12-18 20:20:24,274 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1701 transitions. Word has length 59 [2019-12-18 20:20:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:20:24,274 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1701 transitions. [2019-12-18 20:20:24,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:20:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1701 transitions. [2019-12-18 20:20:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 20:20:24,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:20:24,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:20:24,277 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:20:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:20:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 385115502, now seen corresponding path program 1 times [2019-12-18 20:20:24,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:20:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477105130] [2019-12-18 20:20:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:20:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:20:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:20:24,431 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:20:24,431 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:20:24,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] ULTIMATE.startENTRY-->L808: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_130) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$r_buff0_thd1~0_51) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~x$r_buff1_thd2~0_38 0) (= |v_#NULL.offset_3| 0) (= v_~x$flush_delayed~0_17 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t319~0.base_27| 4)) (= v_~x$r_buff1_thd0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_36) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t319~0.base_27|) |v_ULTIMATE.start_main_~#t319~0.offset_21| 0))) (= |v_ULTIMATE.start_main_~#t319~0.offset_21| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t319~0.base_27|) 0) (= v_~x~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_35) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p1_EAX~0_17) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t319~0.base_27|) (= v_~main$tmp_guard0~0_11 0) (= v_~x$r_buff1_thd1~0_27 0) (= 0 v_~x$r_buff0_thd2~0_75) (= 0 v_~x$w_buff1~0_30) (< 0 |v_#StackHeapBarrier_13|) (= (store .cse0 |v_ULTIMATE.start_main_~#t319~0.base_27| 1) |v_#valid_45|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t319~0.base=|v_ULTIMATE.start_main_~#t319~0.base_27|, ~x$w_buff0~0=v_~x$w_buff0~0_36, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_51, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_~#t319~0.offset=|v_ULTIMATE.start_main_~#t319~0.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, #length=|v_#length_19|, ~y~0=v_~y~0_9, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_30, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_14|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_38, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_23, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_75, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_20|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_130, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_25|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_31, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t319~0.base, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t319~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t320~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t320~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:20:24,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L808-1-->L810: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t320~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t320~0.offset_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t320~0.base_11|) |v_ULTIMATE.start_main_~#t320~0.offset_11| 1)) |v_#memory_int_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t320~0.base_11| 1)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t320~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t320~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t320~0.offset=|v_ULTIMATE.start_main_~#t320~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t320~0.base=|v_ULTIMATE.start_main_~#t320~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t320~0.offset, #length, ULTIMATE.start_main_~#t320~0.base] because there is no mapped edge [2019-12-18 20:20:24,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~x$w_buff1_used~0_51 256)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~x$w_buff1_used~0_51 v_~x$w_buff0_used~0_89) (= 1 v_~x$w_buff0_used~0_88) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x$w_buff0~0_18)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:20:24,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In114108594 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In114108594 256)))) (or (and (= ~x$w_buff1~0_In114108594 |P1Thread1of1ForFork1_#t~ite28_Out114108594|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out114108594| ~x$w_buff0~0_In114108594)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In114108594, ~x$w_buff1~0=~x$w_buff1~0_In114108594, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In114108594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In114108594} OutVars{~x$w_buff0~0=~x$w_buff0~0_In114108594, ~x$w_buff1~0=~x$w_buff1~0_In114108594, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In114108594, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out114108594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In114108594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:20:24,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L770-4-->L771: Formula: (= v_~x~0_21 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~x~0=v_~x~0_21, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 20:20:24,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L775-->L776: Formula: (and (= v_~x$r_buff0_thd2~0_64 v_~x$r_buff0_thd2~0_63) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_9|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_8|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_10|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:20:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-733374706 256)))) (or (and (not .cse0) (= ~x$mem_tmp~0_In-733374706 |P1Thread1of1ForFork1_#t~ite48_Out-733374706|)) (and .cse0 (= ~x~0_In-733374706 |P1Thread1of1ForFork1_#t~ite48_Out-733374706|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-733374706, ~x$mem_tmp~0=~x$mem_tmp~0_In-733374706, ~x~0=~x~0_In-733374706} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-733374706, ~x$mem_tmp~0=~x$mem_tmp~0_In-733374706, ~x~0=~x~0_In-733374706, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-733374706|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-18 20:20:24,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2033067459 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out2033067459| ~x$mem_tmp~0_In2033067459) (not .cse0)) (and .cse0 (= ~x~0_In2033067459 |P0Thread1of1ForFork0_#t~ite25_Out2033067459|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2033067459, ~x$mem_tmp~0=~x$mem_tmp~0_In2033067459, ~x~0=~x~0_In2033067459} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out2033067459|, ~x$flush_delayed~0=~x$flush_delayed~0_In2033067459, ~x$mem_tmp~0=~x$mem_tmp~0_In2033067459, ~x~0=~x~0_In2033067459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-18 20:20:24,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= v_~x~0_24 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= v_~x$flush_delayed~0_12 0) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 20:20:24,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1921860899 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1921860899 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out1921860899| ~x$w_buff0_used~0_In1921860899) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out1921860899| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1921860899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921860899} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1921860899|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1921860899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1921860899} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-18 20:20:24,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L787-->L787-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1099926308 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1099926308 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1099926308 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1099926308 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out1099926308| 0)) (and (= ~x$w_buff1_used~0_In1099926308 |P1Thread1of1ForFork1_#t~ite52_Out1099926308|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1099926308, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1099926308, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1099926308, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1099926308} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out1099926308|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1099926308, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1099926308, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1099926308, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1099926308} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-18 20:20:24,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L788-->L789: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1516966124 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1516966124 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1516966124 ~x$r_buff0_thd2~0_In-1516966124)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out-1516966124 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1516966124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1516966124} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1516966124|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1516966124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1516966124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:20:24,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L789-->L789-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In807144485 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In807144485 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In807144485 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In807144485 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out807144485|)) (and (= ~x$r_buff1_thd2~0_In807144485 |P1Thread1of1ForFork1_#t~ite54_Out807144485|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In807144485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In807144485, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In807144485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807144485} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In807144485, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In807144485, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out807144485|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In807144485, ~x$w_buff0_used~0=~x$w_buff0_used~0_In807144485} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 20:20:24,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_33 |v_P1Thread1of1ForFork1_#t~ite54_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 20:20:24,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L814-->L816-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$w_buff0_used~0_102 256)) (= (mod v_~x$r_buff0_thd0~0_15 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:20:24,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L816-2-->L816-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In2103208343 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In2103208343 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite57_Out2103208343| ~x~0_In2103208343)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In2103208343 |ULTIMATE.start_main_#t~ite57_Out2103208343|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2103208343, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2103208343, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2103208343, ~x~0=~x~0_In2103208343} OutVars{~x$w_buff1~0=~x$w_buff1~0_In2103208343, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out2103208343|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2103208343, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2103208343, ~x~0=~x~0_In2103208343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-18 20:20:24,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L816-4-->L817: Formula: (= v_~x~0_23 |v_ULTIMATE.start_main_#t~ite57_8|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_8|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x~0] because there is no mapped edge [2019-12-18 20:20:24,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In16190919 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In16190919 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out16190919| ~x$w_buff0_used~0_In16190919)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out16190919| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In16190919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In16190919} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In16190919, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out16190919|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In16190919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:20:24,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1758011140 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1758011140 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1758011140 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1758011140 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite60_Out1758011140|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1758011140 |ULTIMATE.start_main_#t~ite60_Out1758011140|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1758011140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1758011140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1758011140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1758011140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1758011140, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1758011140|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1758011140, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1758011140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1758011140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:20:24,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-330300327 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-330300327 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-330300327| 0)) (and (= ~x$r_buff0_thd0~0_In-330300327 |ULTIMATE.start_main_#t~ite61_Out-330300327|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-330300327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-330300327} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-330300327, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-330300327|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-330300327} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:20:24,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1634311717 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1634311717 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1634311717 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1634311717 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1634311717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1634311717| ~x$r_buff1_thd0~0_In1634311717)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1634311717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1634311717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1634311717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1634311717} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1634311717|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1634311717, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1634311717, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1634311717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1634311717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:20:24,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L820-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite62_11|) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:20:24,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:20:24 BasicIcfg [2019-12-18 20:20:24,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:20:24,580 INFO L168 Benchmark]: Toolchain (without parser) took 37913.71 ms. Allocated memory was 140.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 103.7 MB in the beginning and 770.5 MB in the end (delta: -666.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,580 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 140.5 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 20:20:24,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.22 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 156.3 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.90 ms. Allocated memory is still 204.5 MB. Free memory was 156.3 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,582 INFO L168 Benchmark]: Boogie Preprocessor took 65.93 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,583 INFO L168 Benchmark]: RCFGBuilder took 900.45 ms. Allocated memory is still 204.5 MB. Free memory was 150.6 MB in the beginning and 97.3 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,583 INFO L168 Benchmark]: TraceAbstraction took 36046.96 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 97.3 MB in the beginning and 770.5 MB in the end (delta: -673.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:20:24,586 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 140.5 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.22 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 156.3 MB in the end (delta: -53.0 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.90 ms. Allocated memory is still 204.5 MB. Free memory was 156.3 MB in the beginning and 153.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.93 ms. Allocated memory is still 204.5 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 900.45 ms. Allocated memory is still 204.5 MB. Free memory was 150.6 MB in the beginning and 97.3 MB in the end (delta: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36046.96 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 97.3 MB in the beginning and 770.5 MB in the end (delta: -673.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 178 ProgramPointsBefore, 107 ProgramPointsAfterwards, 227 TransitionsBefore, 132 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 27 ChoiceCompositions, 8652 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 131854 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L808] FCALL, FORK 0 pthread_create(&t319, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L810] FCALL, FORK 0 pthread_create(&t320, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L761] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L762] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L763] 2 x$r_buff0_thd2 = (_Bool)1 [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 x$flush_delayed = weak$$choice2 [L769] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L770] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L773] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x = x$flush_delayed ? x$mem_tmp : x [L779] 2 x$flush_delayed = (_Bool)0 [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 1 y = 1 [L730] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L731] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L732] 1 x$flush_delayed = weak$$choice2 [L733] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L735] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L735] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L737] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L740] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L818] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L819] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 35.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3960 SDtfs, 3942 SDslu, 6594 SDs, 0 SdLazy, 3434 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 12 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64025occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 55979 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 81815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...