/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/rfi000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:02:37,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:02:37,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:02:37,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:02:37,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:02:37,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:02:37,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:02:37,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:02:37,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:02:37,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:02:37,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:02:37,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:02:37,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:02:37,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:02:37,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:02:37,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:02:37,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:02:37,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:02:37,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:02:37,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:02:37,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:02:37,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:02:37,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:02:37,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:02:37,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:02:37,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:02:37,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:02:37,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:02:37,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:02:37,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:02:37,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:02:37,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:02:37,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:02:37,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:02:37,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:02:37,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:02:37,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:02:37,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:02:37,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:02:37,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:02:37,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:02:37,280 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-27 07:02:37,299 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:02:37,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:02:37,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:02:37,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:02:37,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:02:37,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:02:37,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:02:37,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:02:37,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:02:37,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:02:37,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:02:37,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:02:37,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:02:37,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:02:37,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:02:37,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:02:37,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:02:37,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:02:37,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:02:37,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:02:37,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:02:37,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:02:37,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:02:37,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:02:37,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:02:37,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:02:37,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:02:37,308 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:02:37,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:02:37,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:02:37,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:02:37,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:02:37,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:02:37,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:02:37,606 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:02:37,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc.i [2019-12-27 07:02:37,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169556d0f/f970a5a3d6024cc9b95936cbce8533bc/FLAGfa9e43d59 [2019-12-27 07:02:38,274 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:02:38,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc.i [2019-12-27 07:02:38,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169556d0f/f970a5a3d6024cc9b95936cbce8533bc/FLAGfa9e43d59 [2019-12-27 07:02:38,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/169556d0f/f970a5a3d6024cc9b95936cbce8533bc [2019-12-27 07:02:38,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:02:38,521 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:02:38,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:02:38,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:02:38,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:02:38,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:02:38" (1/1) ... [2019-12-27 07:02:38,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:38, skipping insertion in model container [2019-12-27 07:02:38,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:02:38" (1/1) ... [2019-12-27 07:02:38,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:02:38,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:02:39,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:02:39,194 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:02:39,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:02:39,344 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:02:39,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39 WrapperNode [2019-12-27 07:02:39,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:02:39,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:02:39,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:02:39,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:02:39,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:02:39,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:02:39,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:02:39,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:02:39,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... [2019-12-27 07:02:39,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:02:39,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:02:39,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:02:39,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:02:39,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:02:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:02:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:02:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:02:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:02:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:02:39,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:02:39,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:02:39,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:02:39,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:02:39,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:02:39,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:02:39,580 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:02:40,763 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:02:40,764 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:02:40,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:02:40 BoogieIcfgContainer [2019-12-27 07:02:40,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:02:40,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:02:40,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:02:40,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:02:40,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:02:38" (1/3) ... [2019-12-27 07:02:40,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e2b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:02:40, skipping insertion in model container [2019-12-27 07:02:40,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:02:39" (2/3) ... [2019-12-27 07:02:40,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e2b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:02:40, skipping insertion in model container [2019-12-27 07:02:40,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:02:40" (3/3) ... [2019-12-27 07:02:40,779 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc.i [2019-12-27 07:02:40,788 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:02:40,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:02:40,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:02:40,797 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:02:40,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:02:40,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:02:40,989 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:02:40,989 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:02:40,989 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:02:40,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:02:40,990 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:02:40,990 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:02:40,990 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:02:40,990 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:02:41,007 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-27 07:02:41,009 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 07:02:41,223 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 07:02:41,223 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:02:41,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 07:02:41,363 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 07:02:41,501 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 07:02:41,501 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:02:41,517 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 07:02:41,550 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-27 07:02:41,551 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:02:45,334 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:02:45,443 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:02:45,532 INFO L206 etLargeBlockEncoding]: Checked pairs total: 254260 [2019-12-27 07:02:45,532 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-27 07:02:45,536 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 192 transitions [2019-12-27 07:02:50,534 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 61532 states. [2019-12-27 07:02:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61532 states. [2019-12-27 07:02:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:02:50,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:50,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:02:50,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1308418, now seen corresponding path program 1 times [2019-12-27 07:02:50,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:50,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741305578] [2019-12-27 07:02:50,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:50,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741305578] [2019-12-27 07:02:50,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:50,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:02:50,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117609832] [2019-12-27 07:02:50,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:02:50,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:50,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:02:50,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:50,816 INFO L87 Difference]: Start difference. First operand 61532 states. Second operand 3 states. [2019-12-27 07:02:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:02:52,004 INFO L93 Difference]: Finished difference Result 61201 states and 218127 transitions. [2019-12-27 07:02:52,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:02:52,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:02:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:02:52,431 INFO L225 Difference]: With dead ends: 61201 [2019-12-27 07:02:52,431 INFO L226 Difference]: Without dead ends: 60135 [2019-12-27 07:02:52,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:02:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60135 states. [2019-12-27 07:02:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60135 to 60135. [2019-12-27 07:02:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60135 states. [2019-12-27 07:02:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60135 states to 60135 states and 214522 transitions. [2019-12-27 07:02:57,105 INFO L78 Accepts]: Start accepts. Automaton has 60135 states and 214522 transitions. Word has length 3 [2019-12-27 07:02:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:02:57,106 INFO L462 AbstractCegarLoop]: Abstraction has 60135 states and 214522 transitions. [2019-12-27 07:02:57,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:02:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 60135 states and 214522 transitions. [2019-12-27 07:02:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:02:57,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:02:57,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:02:57,111 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:02:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:02:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2019764645, now seen corresponding path program 1 times [2019-12-27 07:02:57,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:02:57,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773115252] [2019-12-27 07:02:57,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:02:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:02:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:02:57,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773115252] [2019-12-27 07:02:57,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:02:57,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:02:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139251693] [2019-12-27 07:02:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:02:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:02:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:02:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:02:57,260 INFO L87 Difference]: Start difference. First operand 60135 states and 214522 transitions. Second operand 4 states. [2019-12-27 07:03:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:00,499 INFO L93 Difference]: Finished difference Result 81270 states and 280051 transitions. [2019-12-27 07:03:00,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:00,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:03:00,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:00,887 INFO L225 Difference]: With dead ends: 81270 [2019-12-27 07:03:00,887 INFO L226 Difference]: Without dead ends: 81270 [2019-12-27 07:03:00,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81270 states. [2019-12-27 07:03:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81270 to 81072. [2019-12-27 07:03:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81072 states. [2019-12-27 07:03:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81072 states to 81072 states and 279514 transitions. [2019-12-27 07:03:03,698 INFO L78 Accepts]: Start accepts. Automaton has 81072 states and 279514 transitions. Word has length 11 [2019-12-27 07:03:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:03,699 INFO L462 AbstractCegarLoop]: Abstraction has 81072 states and 279514 transitions. [2019-12-27 07:03:03,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 81072 states and 279514 transitions. [2019-12-27 07:03:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:03:03,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:03,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:03,706 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:03,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash -312179638, now seen corresponding path program 1 times [2019-12-27 07:03:03,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:03,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107364351] [2019-12-27 07:03:03,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:03,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107364351] [2019-12-27 07:03:03,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:03,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:03,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833623613] [2019-12-27 07:03:03,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:03,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:03,791 INFO L87 Difference]: Start difference. First operand 81072 states and 279514 transitions. Second operand 4 states. [2019-12-27 07:03:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:05,104 INFO L93 Difference]: Finished difference Result 98023 states and 334543 transitions. [2019-12-27 07:03:05,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:05,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:03:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:05,366 INFO L225 Difference]: With dead ends: 98023 [2019-12-27 07:03:05,366 INFO L226 Difference]: Without dead ends: 98023 [2019-12-27 07:03:05,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:09,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98023 states. [2019-12-27 07:03:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98023 to 91419. [2019-12-27 07:03:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91419 states. [2019-12-27 07:03:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91419 states to 91419 states and 312836 transitions. [2019-12-27 07:03:10,987 INFO L78 Accepts]: Start accepts. Automaton has 91419 states and 312836 transitions. Word has length 14 [2019-12-27 07:03:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:10,988 INFO L462 AbstractCegarLoop]: Abstraction has 91419 states and 312836 transitions. [2019-12-27 07:03:10,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 91419 states and 312836 transitions. [2019-12-27 07:03:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 07:03:10,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:10,997 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-27 07:03:10,998 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1657200338, now seen corresponding path program 1 times [2019-12-27 07:03:10,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:10,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005097350] [2019-12-27 07:03:10,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:11,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005097350] [2019-12-27 07:03:11,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:11,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:11,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718600465] [2019-12-27 07:03:11,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:11,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:11,079 INFO L87 Difference]: Start difference. First operand 91419 states and 312836 transitions. Second operand 4 states. [2019-12-27 07:03:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:11,141 INFO L93 Difference]: Finished difference Result 8836 states and 22781 transitions. [2019-12-27 07:03:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:03:11,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 07:03:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:11,156 INFO L225 Difference]: With dead ends: 8836 [2019-12-27 07:03:11,156 INFO L226 Difference]: Without dead ends: 7489 [2019-12-27 07:03:11,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7489 states. [2019-12-27 07:03:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7489 to 7481. [2019-12-27 07:03:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7481 states. [2019-12-27 07:03:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7481 states to 7481 states and 18430 transitions. [2019-12-27 07:03:11,280 INFO L78 Accepts]: Start accepts. Automaton has 7481 states and 18430 transitions. Word has length 20 [2019-12-27 07:03:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:11,280 INFO L462 AbstractCegarLoop]: Abstraction has 7481 states and 18430 transitions. [2019-12-27 07:03:11,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7481 states and 18430 transitions. [2019-12-27 07:03:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 07:03:11,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:11,284 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] [2019-12-27 07:03:11,285 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:11,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1306986868, now seen corresponding path program 1 times [2019-12-27 07:03:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:11,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137844891] [2019-12-27 07:03:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:11,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137844891] [2019-12-27 07:03:11,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:11,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:11,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250499337] [2019-12-27 07:03:11,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:11,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:11,420 INFO L87 Difference]: Start difference. First operand 7481 states and 18430 transitions. Second operand 5 states. [2019-12-27 07:03:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:12,458 INFO L93 Difference]: Finished difference Result 8567 states and 20880 transitions. [2019-12-27 07:03:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:12,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 07:03:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:12,468 INFO L225 Difference]: With dead ends: 8567 [2019-12-27 07:03:12,468 INFO L226 Difference]: Without dead ends: 8567 [2019-12-27 07:03:12,469 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-27 07:03:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2019-12-27 07:03:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 8465. [2019-12-27 07:03:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8465 states. [2019-12-27 07:03:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 20682 transitions. [2019-12-27 07:03:12,562 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 20682 transitions. Word has length 30 [2019-12-27 07:03:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:12,563 INFO L462 AbstractCegarLoop]: Abstraction has 8465 states and 20682 transitions. [2019-12-27 07:03:12,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 20682 transitions. [2019-12-27 07:03:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:03:12,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:12,566 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-27 07:03:12,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1861858661, now seen corresponding path program 1 times [2019-12-27 07:03:12,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:12,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231250898] [2019-12-27 07:03:12,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:12,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231250898] [2019-12-27 07:03:12,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:12,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:12,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452060429] [2019-12-27 07:03:12,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:12,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:12,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:12,616 INFO L87 Difference]: Start difference. First operand 8465 states and 20682 transitions. Second operand 3 states. [2019-12-27 07:03:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:12,769 INFO L93 Difference]: Finished difference Result 12677 states and 29440 transitions. [2019-12-27 07:03:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:12,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 07:03:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:12,788 INFO L225 Difference]: With dead ends: 12677 [2019-12-27 07:03:12,788 INFO L226 Difference]: Without dead ends: 12677 [2019-12-27 07:03:12,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12677 states. [2019-12-27 07:03:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12677 to 11628. [2019-12-27 07:03:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11628 states. [2019-12-27 07:03:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11628 states to 11628 states and 27275 transitions. [2019-12-27 07:03:12,951 INFO L78 Accepts]: Start accepts. Automaton has 11628 states and 27275 transitions. Word has length 31 [2019-12-27 07:03:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:12,951 INFO L462 AbstractCegarLoop]: Abstraction has 11628 states and 27275 transitions. [2019-12-27 07:03:12,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11628 states and 27275 transitions. [2019-12-27 07:03:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:03:12,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:12,955 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] [2019-12-27 07:03:12,956 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -483432237, now seen corresponding path program 1 times [2019-12-27 07:03:12,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:12,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107941811] [2019-12-27 07:03:12,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:13,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-27 07:03:13,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107941811] [2019-12-27 07:03:13,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:13,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:13,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321436887] [2019-12-27 07:03:13,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:13,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:13,027 INFO L87 Difference]: Start difference. First operand 11628 states and 27275 transitions. Second operand 5 states. [2019-12-27 07:03:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:13,568 INFO L93 Difference]: Finished difference Result 13153 states and 30540 transitions. [2019-12-27 07:03:13,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:13,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 07:03:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:13,583 INFO L225 Difference]: With dead ends: 13153 [2019-12-27 07:03:13,583 INFO L226 Difference]: Without dead ends: 13153 [2019-12-27 07:03:13,583 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-27 07:03:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13153 states. [2019-12-27 07:03:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13153 to 11842. [2019-12-27 07:03:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-12-27 07:03:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 27752 transitions. [2019-12-27 07:03:13,727 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 27752 transitions. Word has length 33 [2019-12-27 07:03:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:13,728 INFO L462 AbstractCegarLoop]: Abstraction has 11842 states and 27752 transitions. [2019-12-27 07:03:13,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 27752 transitions. [2019-12-27 07:03:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 07:03:13,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:13,736 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-27 07:03:13,737 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2081393196, now seen corresponding path program 1 times [2019-12-27 07:03:13,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:13,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177808312] [2019-12-27 07:03:13,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:13,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177808312] [2019-12-27 07:03:13,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:13,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:03:13,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628737933] [2019-12-27 07:03:13,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:13,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:13,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:13,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:13,836 INFO L87 Difference]: Start difference. First operand 11842 states and 27752 transitions. Second operand 5 states. [2019-12-27 07:03:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:15,827 INFO L93 Difference]: Finished difference Result 13957 states and 32244 transitions. [2019-12-27 07:03:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:03:15,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 07:03:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:15,845 INFO L225 Difference]: With dead ends: 13957 [2019-12-27 07:03:15,845 INFO L226 Difference]: Without dead ends: 13957 [2019-12-27 07:03:15,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2019-12-27 07:03:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 13295. [2019-12-27 07:03:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13295 states. [2019-12-27 07:03:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 30887 transitions. [2019-12-27 07:03:16,000 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 30887 transitions. Word has length 42 [2019-12-27 07:03:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:16,001 INFO L462 AbstractCegarLoop]: Abstraction has 13295 states and 30887 transitions. [2019-12-27 07:03:16,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 30887 transitions. [2019-12-27 07:03:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 07:03:16,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:16,008 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-27 07:03:16,008 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 428477981, now seen corresponding path program 1 times [2019-12-27 07:03:16,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:16,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434856849] [2019-12-27 07:03:16,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:16,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434856849] [2019-12-27 07:03:16,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:16,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:03:16,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577859521] [2019-12-27 07:03:16,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:03:16,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:03:16,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:16,106 INFO L87 Difference]: Start difference. First operand 13295 states and 30887 transitions. Second operand 6 states. [2019-12-27 07:03:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:16,821 INFO L93 Difference]: Finished difference Result 15410 states and 35255 transitions. [2019-12-27 07:03:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:03:16,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-27 07:03:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:16,838 INFO L225 Difference]: With dead ends: 15410 [2019-12-27 07:03:16,839 INFO L226 Difference]: Without dead ends: 15385 [2019-12-27 07:03:16,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2019-12-27 07:03:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 14466. [2019-12-27 07:03:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14466 states. [2019-12-27 07:03:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14466 states to 14466 states and 33448 transitions. [2019-12-27 07:03:17,001 INFO L78 Accepts]: Start accepts. Automaton has 14466 states and 33448 transitions. Word has length 43 [2019-12-27 07:03:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:17,001 INFO L462 AbstractCegarLoop]: Abstraction has 14466 states and 33448 transitions. [2019-12-27 07:03:17,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:03:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14466 states and 33448 transitions. [2019-12-27 07:03:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 07:03:17,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:17,010 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-27 07:03:17,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1666784848, now seen corresponding path program 1 times [2019-12-27 07:03:17,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:17,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519624257] [2019-12-27 07:03:17,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:17,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519624257] [2019-12-27 07:03:17,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:17,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:03:17,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461995328] [2019-12-27 07:03:17,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:17,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:17,095 INFO L87 Difference]: Start difference. First operand 14466 states and 33448 transitions. Second operand 5 states. [2019-12-27 07:03:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:17,154 INFO L93 Difference]: Finished difference Result 3468 states and 7339 transitions. [2019-12-27 07:03:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:17,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 07:03:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:17,160 INFO L225 Difference]: With dead ends: 3468 [2019-12-27 07:03:17,160 INFO L226 Difference]: Without dead ends: 3184 [2019-12-27 07:03:17,160 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-27 07:03:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2019-12-27 07:03:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3003. [2019-12-27 07:03:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-12-27 07:03:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 6400 transitions. [2019-12-27 07:03:17,201 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 6400 transitions. Word has length 43 [2019-12-27 07:03:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:17,202 INFO L462 AbstractCegarLoop]: Abstraction has 3003 states and 6400 transitions. [2019-12-27 07:03:17,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 6400 transitions. [2019-12-27 07:03:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 07:03:17,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:17,207 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] [2019-12-27 07:03:17,208 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1149224758, now seen corresponding path program 1 times [2019-12-27 07:03:17,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:17,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198910567] [2019-12-27 07:03:17,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:17,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198910567] [2019-12-27 07:03:17,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:17,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:17,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960042945] [2019-12-27 07:03:17,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:17,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:17,258 INFO L87 Difference]: Start difference. First operand 3003 states and 6400 transitions. Second operand 3 states. [2019-12-27 07:03:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:17,329 INFO L93 Difference]: Finished difference Result 3346 states and 6732 transitions. [2019-12-27 07:03:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:17,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 07:03:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:17,334 INFO L225 Difference]: With dead ends: 3346 [2019-12-27 07:03:17,334 INFO L226 Difference]: Without dead ends: 3346 [2019-12-27 07:03:17,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-27 07:03:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2967. [2019-12-27 07:03:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2967 states. [2019-12-27 07:03:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 6009 transitions. [2019-12-27 07:03:17,373 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 6009 transitions. Word has length 46 [2019-12-27 07:03:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:17,374 INFO L462 AbstractCegarLoop]: Abstraction has 2967 states and 6009 transitions. [2019-12-27 07:03:17,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 6009 transitions. [2019-12-27 07:03:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 07:03:17,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:17,379 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] [2019-12-27 07:03:17,379 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -549380219, now seen corresponding path program 1 times [2019-12-27 07:03:17,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:17,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76010576] [2019-12-27 07:03:17,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:17,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76010576] [2019-12-27 07:03:17,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:17,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:03:17,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327154026] [2019-12-27 07:03:17,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:03:17,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:03:17,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:17,477 INFO L87 Difference]: Start difference. First operand 2967 states and 6009 transitions. Second operand 6 states. [2019-12-27 07:03:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:17,814 INFO L93 Difference]: Finished difference Result 3202 states and 6432 transitions. [2019-12-27 07:03:17,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:03:17,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-27 07:03:17,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:17,819 INFO L225 Difference]: With dead ends: 3202 [2019-12-27 07:03:17,819 INFO L226 Difference]: Without dead ends: 3134 [2019-12-27 07:03:17,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2019-12-27 07:03:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2882. [2019-12-27 07:03:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2019-12-27 07:03:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 5827 transitions. [2019-12-27 07:03:17,843 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 5827 transitions. Word has length 49 [2019-12-27 07:03:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:17,843 INFO L462 AbstractCegarLoop]: Abstraction has 2882 states and 5827 transitions. [2019-12-27 07:03:17,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:03:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 5827 transitions. [2019-12-27 07:03:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 07:03:17,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:17,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:17,848 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1384279063, now seen corresponding path program 1 times [2019-12-27 07:03:17,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:17,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610230427] [2019-12-27 07:03:17,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:17,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610230427] [2019-12-27 07:03:17,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:17,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:03:17,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854273367] [2019-12-27 07:03:17,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:17,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:17,960 INFO L87 Difference]: Start difference. First operand 2882 states and 5827 transitions. Second operand 5 states. [2019-12-27 07:03:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:18,168 INFO L93 Difference]: Finished difference Result 4499 states and 9108 transitions. [2019-12-27 07:03:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:18,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-27 07:03:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:18,173 INFO L225 Difference]: With dead ends: 4499 [2019-12-27 07:03:18,174 INFO L226 Difference]: Without dead ends: 4499 [2019-12-27 07:03:18,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-12-27 07:03:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 3832. [2019-12-27 07:03:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2019-12-27 07:03:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 7842 transitions. [2019-12-27 07:03:18,231 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 7842 transitions. Word has length 85 [2019-12-27 07:03:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:18,232 INFO L462 AbstractCegarLoop]: Abstraction has 3832 states and 7842 transitions. [2019-12-27 07:03:18,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 7842 transitions. [2019-12-27 07:03:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 07:03:18,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:18,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:18,239 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2146217659, now seen corresponding path program 1 times [2019-12-27 07:03:18,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:18,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808580078] [2019-12-27 07:03:18,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:18,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808580078] [2019-12-27 07:03:18,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:18,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:18,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188738484] [2019-12-27 07:03:18,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:18,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:18,418 INFO L87 Difference]: Start difference. First operand 3832 states and 7842 transitions. Second operand 3 states. [2019-12-27 07:03:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:18,470 INFO L93 Difference]: Finished difference Result 3831 states and 7840 transitions. [2019-12-27 07:03:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:18,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-27 07:03:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:18,474 INFO L225 Difference]: With dead ends: 3831 [2019-12-27 07:03:18,474 INFO L226 Difference]: Without dead ends: 3831 [2019-12-27 07:03:18,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-12-27 07:03:18,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3457. [2019-12-27 07:03:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2019-12-27 07:03:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 7134 transitions. [2019-12-27 07:03:18,515 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 7134 transitions. Word has length 86 [2019-12-27 07:03:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:18,516 INFO L462 AbstractCegarLoop]: Abstraction has 3457 states and 7134 transitions. [2019-12-27 07:03:18,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 7134 transitions. [2019-12-27 07:03:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:18,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:18,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:18,520 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -618624095, now seen corresponding path program 1 times [2019-12-27 07:03:18,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:18,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643357082] [2019-12-27 07:03:18,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:18,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643357082] [2019-12-27 07:03:18,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:18,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:03:18,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120107422] [2019-12-27 07:03:18,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:03:18,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:03:18,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:18,715 INFO L87 Difference]: Start difference. First operand 3457 states and 7134 transitions. Second operand 9 states. [2019-12-27 07:03:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:19,717 INFO L93 Difference]: Finished difference Result 12059 states and 24791 transitions. [2019-12-27 07:03:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:03:19,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-27 07:03:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:19,729 INFO L225 Difference]: With dead ends: 12059 [2019-12-27 07:03:19,729 INFO L226 Difference]: Without dead ends: 9304 [2019-12-27 07:03:19,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-27 07:03:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9304 states. [2019-12-27 07:03:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9304 to 3541. [2019-12-27 07:03:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-12-27 07:03:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 7277 transitions. [2019-12-27 07:03:19,801 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 7277 transitions. Word has length 87 [2019-12-27 07:03:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:19,801 INFO L462 AbstractCegarLoop]: Abstraction has 3541 states and 7277 transitions. [2019-12-27 07:03:19,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:03:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 7277 transitions. [2019-12-27 07:03:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:19,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:19,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:19,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1610652577, now seen corresponding path program 2 times [2019-12-27 07:03:19,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:19,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978959375] [2019-12-27 07:03:19,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:19,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978959375] [2019-12-27 07:03:19,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:19,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:03:19,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343573385] [2019-12-27 07:03:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:03:19,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:03:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:19,970 INFO L87 Difference]: Start difference. First operand 3541 states and 7277 transitions. Second operand 9 states. [2019-12-27 07:03:20,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:20,913 INFO L93 Difference]: Finished difference Result 9645 states and 19793 transitions. [2019-12-27 07:03:20,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:03:20,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-27 07:03:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:20,922 INFO L225 Difference]: With dead ends: 9645 [2019-12-27 07:03:20,922 INFO L226 Difference]: Without dead ends: 7544 [2019-12-27 07:03:20,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:03:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-12-27 07:03:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 3884. [2019-12-27 07:03:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3884 states. [2019-12-27 07:03:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 7948 transitions. [2019-12-27 07:03:21,024 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 7948 transitions. Word has length 87 [2019-12-27 07:03:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:21,024 INFO L462 AbstractCegarLoop]: Abstraction has 3884 states and 7948 transitions. [2019-12-27 07:03:21,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:03:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 7948 transitions. [2019-12-27 07:03:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:21,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:21,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:21,035 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2019008161, now seen corresponding path program 3 times [2019-12-27 07:03:21,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:21,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549064817] [2019-12-27 07:03:21,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:21,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549064817] [2019-12-27 07:03:21,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:21,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:21,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548603138] [2019-12-27 07:03:21,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:21,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:21,193 INFO L87 Difference]: Start difference. First operand 3884 states and 7948 transitions. Second operand 4 states. [2019-12-27 07:03:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:21,249 INFO L93 Difference]: Finished difference Result 6402 states and 13099 transitions. [2019-12-27 07:03:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:03:21,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-27 07:03:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:21,254 INFO L225 Difference]: With dead ends: 6402 [2019-12-27 07:03:21,254 INFO L226 Difference]: Without dead ends: 2595 [2019-12-27 07:03:21,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-12-27 07:03:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2595. [2019-12-27 07:03:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2019-12-27 07:03:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 5298 transitions. [2019-12-27 07:03:21,306 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 5298 transitions. Word has length 87 [2019-12-27 07:03:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:21,307 INFO L462 AbstractCegarLoop]: Abstraction has 2595 states and 5298 transitions. [2019-12-27 07:03:21,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 5298 transitions. [2019-12-27 07:03:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:21,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:21,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:21,315 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1160744719, now seen corresponding path program 4 times [2019-12-27 07:03:21,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:21,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079418622] [2019-12-27 07:03:21,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:03:21,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079418622] [2019-12-27 07:03:21,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:21,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:03:21,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998528528] [2019-12-27 07:03:21,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:03:21,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:03:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:03:21,952 INFO L87 Difference]: Start difference. First operand 2595 states and 5298 transitions. Second operand 20 states. [2019-12-27 07:03:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:23,260 INFO L93 Difference]: Finished difference Result 4187 states and 8397 transitions. [2019-12-27 07:03:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 07:03:23,261 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-12-27 07:03:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:23,266 INFO L225 Difference]: With dead ends: 4187 [2019-12-27 07:03:23,266 INFO L226 Difference]: Without dead ends: 4146 [2019-12-27 07:03:23,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 07:03:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2019-12-27 07:03:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 3146. [2019-12-27 07:03:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2019-12-27 07:03:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 6379 transitions. [2019-12-27 07:03:23,301 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 6379 transitions. Word has length 87 [2019-12-27 07:03:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:23,301 INFO L462 AbstractCegarLoop]: Abstraction has 3146 states and 6379 transitions. [2019-12-27 07:03:23,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:03:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 6379 transitions. [2019-12-27 07:03:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:23,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:23,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:23,306 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -4069085, now seen corresponding path program 5 times [2019-12-27 07:03:23,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:23,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813078530] [2019-12-27 07:03:23,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:03:23,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:03:23,460 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:03:23,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1293] [1293] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff0_thd2~0_106) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_59) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1_used~0_95 0) (= 0 v_~y$w_buff0~0_45) (= v_~y$w_buff0_used~0_180 0) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_20| 1)) (= |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_46 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1585~0.base_20|) |v_ULTIMATE.start_main_~#t1585~0.offset_16| 0)) |v_#memory_int_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1585~0.base_20|)) (= v_~y$r_buff0_thd0~0_62 0) (= 0 v_~y$r_buff1_thd1~0_18) (= 0 v_~weak$$choice2~0_44) (= 0 |v_#NULL.base_7|) (= 0 v_~y$r_buff1_thd0~0_34) (= 0 v_~y$flush_delayed~0_26) (= v_~y$mem_tmp~0_12 0) (= 0 v_~y$w_buff1~0_41) (= v_~x~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1585~0.base_20|) (= v_~__unbuffered_p1_EBX~0_11 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1585~0.base_20| 4)) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_10|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_10|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_14|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_8|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_12|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_13|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_12|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, #length=|v_#length_17|, ULTIMATE.start_main_~#t1585~0.offset=|v_ULTIMATE.start_main_~#t1585~0.offset_16|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_7|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_14|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_12|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_13|, ~y$w_buff1~0=v_~y$w_buff1~0_41, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_13|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_34, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_180, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t1585~0.base=|v_ULTIMATE.start_main_~#t1585~0.base_20|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_10|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_10|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_14|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_12|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_23|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_45, ~y~0=v_~y~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_13|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_14|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_95} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ULTIMATE.start_main_~#t1586~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1585~0.offset, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1585~0.base, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_~#t1586~0.offset, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:03:23,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1259] [1259] L813-1-->L815: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1586~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1586~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1586~0.offset_9| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1586~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1586~0.base_10|) |v_ULTIMATE.start_main_~#t1586~0.offset_9| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1586~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1586~0.base=|v_ULTIMATE.start_main_~#t1586~0.base_10|, ULTIMATE.start_main_~#t1586~0.offset=|v_ULTIMATE.start_main_~#t1586~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1586~0.base, ULTIMATE.start_main_~#t1586~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 07:03:23,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_32 v_~y$w_buff1~0_29) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~y$w_buff0~0_31) (= v_~y$w_buff1_used~0_83 v_~y$w_buff0_used~0_153) (= v_~y$w_buff0_used~0_152 1) (= (mod v_~y$w_buff1_used~0_83 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff0~0=v_~y$w_buff0~0_32, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_31, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:03:23,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-633458618 256) 0))) (or (and .cse0 (= ~y~0_In-633458618 |P1Thread1of1ForFork1_#t~ite31_Out-633458618|)) (and (not .cse0) (= ~y$mem_tmp~0_In-633458618 |P1Thread1of1ForFork1_#t~ite31_Out-633458618|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-633458618, ~y$flush_delayed~0=~y$flush_delayed~0_In-633458618, ~y~0=~y~0_In-633458618} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-633458618, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-633458618|, ~y$flush_delayed~0=~y$flush_delayed~0_In-633458618, ~y~0=~y~0_In-633458618} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 07:03:23,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-752968994 256)))) (or (and (= ~y~0_In-752968994 |P1Thread1of1ForFork1_#t~ite54_Out-752968994|) .cse0) (and (= ~y$mem_tmp~0_In-752968994 |P1Thread1of1ForFork1_#t~ite54_Out-752968994|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-752968994, ~y$flush_delayed~0=~y$flush_delayed~0_In-752968994, ~y~0=~y~0_In-752968994} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-752968994, ~y$flush_delayed~0=~y$flush_delayed~0_In-752968994, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-752968994|, ~y~0=~y~0_In-752968994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 07:03:23,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2033539435 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2033539435 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2033539435| ~y$w_buff0_used~0_In2033539435) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2033539435| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2033539435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2033539435} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2033539435|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2033539435, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2033539435} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:03:23,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1876306880 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1876306880 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1876306880 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1876306880 256)))) (or (and (= ~y$w_buff1_used~0_In1876306880 |P0Thread1of1ForFork0_#t~ite6_Out1876306880|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1876306880|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1876306880, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1876306880, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1876306880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1876306880} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1876306880|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1876306880, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1876306880, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1876306880, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1876306880} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:03:23,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1010094186 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1010094186 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1010094186 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1010094186 ~y$r_buff0_thd1~0_In1010094186)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1010094186, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1010094186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1010094186, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1010094186|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1010094186} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:03:23,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1903899703 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1903899703 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1903899703 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1903899703 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1903899703| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1903899703| ~y$r_buff1_thd1~0_In1903899703) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1903899703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1903899703, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1903899703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1903899703} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1903899703, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1903899703, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1903899703|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1903899703, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1903899703} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:03:23,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1252] [1252] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:03:23,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite56_Out-1764239940| |P1Thread1of1ForFork1_#t~ite55_Out-1764239940|)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1764239940 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1764239940 256)))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-1764239940 |P1Thread1of1ForFork1_#t~ite55_Out-1764239940|) (not .cse2)) (and (= ~y~0_In-1764239940 |P1Thread1of1ForFork1_#t~ite55_Out-1764239940|) .cse1 (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1764239940, ~y$w_buff1~0=~y$w_buff1~0_In-1764239940, ~y~0=~y~0_In-1764239940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764239940} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1764239940, ~y$w_buff1~0=~y$w_buff1~0_In-1764239940, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-1764239940|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-1764239940|, ~y~0=~y~0_In-1764239940, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764239940} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-27 07:03:23,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1302102510 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1302102510 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out1302102510| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out1302102510| ~y$w_buff0_used~0_In1302102510) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1302102510, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302102510} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1302102510, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1302102510, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1302102510|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-27 07:03:23,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In884409075 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In884409075 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In884409075 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In884409075 256) 0))) (or (and (= ~y$w_buff1_used~0_In884409075 |P1Thread1of1ForFork1_#t~ite58_Out884409075|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out884409075|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In884409075, ~y$w_buff0_used~0=~y$w_buff0_used~0_In884409075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In884409075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In884409075} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In884409075, ~y$w_buff0_used~0=~y$w_buff0_used~0_In884409075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In884409075, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out884409075|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In884409075} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-27 07:03:23,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1845754844 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1845754844 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1845754844 |P1Thread1of1ForFork1_#t~ite59_Out1845754844|)) (and (= |P1Thread1of1ForFork1_#t~ite59_Out1845754844| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1845754844, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845754844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1845754844, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1845754844, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out1845754844|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-27 07:03:23,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1355505439 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1355505439 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1355505439 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1355505439 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1355505439 |P1Thread1of1ForFork1_#t~ite60_Out-1355505439|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out-1355505439| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1355505439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1355505439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1355505439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1355505439} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1355505439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1355505439, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1355505439|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1355505439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1355505439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 07:03:23,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~y$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork1_#t~ite60_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_55, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:03:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~y$r_buff0_thd0~0_52 256) 0) (= 0 (mod v_~y$w_buff0_used~0_147 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_147, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:03:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-47424654 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-47424654 256) 0))) (or (and (= ~y~0_In-47424654 |ULTIMATE.start_main_#t~ite63_Out-47424654|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-47424654 |ULTIMATE.start_main_#t~ite63_Out-47424654|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-47424654, ~y~0=~y~0_In-47424654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47424654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47424654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-47424654|, ~y$w_buff1~0=~y$w_buff1~0_In-47424654, ~y~0=~y~0_In-47424654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47424654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47424654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 07:03:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite63_7|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_7|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_6|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 07:03:23,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-686860557 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-686860557 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite65_Out-686860557|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-686860557 |ULTIMATE.start_main_#t~ite65_Out-686860557|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-686860557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-686860557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-686860557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-686860557, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-686860557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 07:03:23,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-487968667 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-487968667 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-487968667 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-487968667 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-487968667| ~y$w_buff1_used~0_In-487968667)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite66_Out-487968667| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-487968667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-487968667, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487968667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487968667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-487968667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-487968667, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-487968667|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-487968667, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-487968667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 07:03:23,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-243469622 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-243469622 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-243469622|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-243469622 |ULTIMATE.start_main_#t~ite67_Out-243469622|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-243469622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243469622} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-243469622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243469622, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-243469622|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 07:03:23,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-2083049827 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2083049827 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2083049827 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2083049827 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-2083049827 |ULTIMATE.start_main_#t~ite68_Out-2083049827|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite68_Out-2083049827|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2083049827, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2083049827, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2083049827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2083049827} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2083049827, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2083049827, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-2083049827|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2083049827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2083049827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 07:03:23,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-937486592 256) 0))) (or (and (= ~y$mem_tmp~0_In-937486592 |ULTIMATE.start_main_#t~ite91_Out-937486592|) (not .cse0)) (and (= ~y~0_In-937486592 |ULTIMATE.start_main_#t~ite91_Out-937486592|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-937486592, ~y$flush_delayed~0=~y$flush_delayed~0_In-937486592, ~y~0=~y~0_In-937486592} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-937486592, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-937486592|, ~y$flush_delayed~0=~y$flush_delayed~0_In-937486592, ~y~0=~y~0_In-937486592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-27 07:03:23,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1276] [1276] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~y$flush_delayed~0_18) (= v_~y~0_38 |v_ULTIMATE.start_main_#t~ite91_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y~0=v_~y~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:03:23,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:03:23 BasicIcfg [2019-12-27 07:03:23,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:03:23,642 INFO L168 Benchmark]: Toolchain (without parser) took 45121.00 ms. Allocated memory was 146.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.5 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 393.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,642 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.23 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 155.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,644 INFO L168 Benchmark]: Boogie Preprocessor took 75.48 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 149.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,645 INFO L168 Benchmark]: RCFGBuilder took 1275.84 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 149.7 MB in the beginning and 193.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,645 INFO L168 Benchmark]: TraceAbstraction took 42872.36 ms. Allocated memory was 234.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 192.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:03:23,649 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.23 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 155.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 204.5 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.48 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 149.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1275.84 ms. Allocated memory was 204.5 MB in the beginning and 234.9 MB in the end (delta: 30.4 MB). Free memory was 149.7 MB in the beginning and 193.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42872.36 ms. Allocated memory was 234.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 192.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 231 ProgramPointsBefore, 154 ProgramPointsAfterwards, 307 TransitionsBefore, 192 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 67 ConcurrentYvCompositions, 41 ChoiceCompositions, 14327 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 254260 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=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=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=6, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6526 SDtfs, 5053 SDslu, 20163 SDs, 0 SdLazy, 6307 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91419occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 23129 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 971 NumberOfCodeBlocks, 971 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 866 ConstructedInterpolants, 0 QuantifiedInterpolants, 284680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...