/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 09:37:37,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 09:37:37,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 09:37:37,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 09:37:37,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 09:37:37,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 09:37:37,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 09:37:37,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 09:37:37,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 09:37:37,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 09:37:37,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 09:37:37,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 09:37:37,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 09:37:37,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 09:37:37,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 09:37:37,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 09:37:37,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 09:37:37,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 09:37:37,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 09:37:37,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 09:37:37,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 09:37:37,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 09:37:37,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 09:37:37,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 09:37:37,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 09:37:37,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 09:37:37,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 09:37:37,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 09:37:37,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 09:37:37,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 09:37:37,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 09:37:37,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 09:37:37,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 09:37:37,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 09:37:37,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 09:37:37,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 09:37:37,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 09:37:37,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 09:37:37,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 09:37:37,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 09:37:37,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 09:37:37,122 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-NoLbe.epf [2019-12-27 09:37:37,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 09:37:37,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 09:37:37,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 09:37:37,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 09:37:37,138 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 09:37:37,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 09:37:37,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 09:37:37,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 09:37:37,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 09:37:37,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 09:37:37,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 09:37:37,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 09:37:37,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 09:37:37,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 09:37:37,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 09:37:37,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 09:37:37,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 09:37:37,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 09:37:37,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 09:37:37,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 09:37:37,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 09:37:37,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 09:37:37,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 09:37:37,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 09:37:37,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 09:37:37,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 09:37:37,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 09:37:37,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 09:37:37,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 09:37:37,428 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 09:37:37,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_rmo.opt.i [2019-12-27 09:37:37,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a93cf2fd/6ac04937aa084274bb37a0519877a635/FLAG2f15d2214 [2019-12-27 09:37:38,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 09:37:38,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_rmo.opt.i [2019-12-27 09:37:38,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a93cf2fd/6ac04937aa084274bb37a0519877a635/FLAG2f15d2214 [2019-12-27 09:37:38,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a93cf2fd/6ac04937aa084274bb37a0519877a635 [2019-12-27 09:37:38,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 09:37:38,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 09:37:38,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 09:37:38,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 09:37:38,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 09:37:38,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:38" (1/1) ... [2019-12-27 09:37:38,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b535951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:38, skipping insertion in model container [2019-12-27 09:37:38,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:38" (1/1) ... [2019-12-27 09:37:38,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 09:37:38,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 09:37:38,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:37:38,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 09:37:39,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:37:39,172 INFO L208 MainTranslator]: Completed translation [2019-12-27 09:37:39,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39 WrapperNode [2019-12-27 09:37:39,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 09:37:39,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 09:37:39,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 09:37:39,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 09:37:39,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 09:37:39,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 09:37:39,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 09:37:39,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 09:37:39,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (1/1) ... [2019-12-27 09:37:39,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 09:37:39,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 09:37:39,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 09:37:39,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 09:37:39,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37: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 09:37:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 09:37:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 09:37:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 09:37:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 09:37:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 09:37:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 09:37:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 09:37:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 09:37:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 09:37:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 09:37:39,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 09:37:39,373 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 09:37:40,178 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 09:37:40,178 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 09:37:40,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:40 BoogieIcfgContainer [2019-12-27 09:37:40,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 09:37:40,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 09:37:40,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 09:37:40,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 09:37:40,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:37:38" (1/3) ... [2019-12-27 09:37:40,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f19c692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:40, skipping insertion in model container [2019-12-27 09:37:40,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:39" (2/3) ... [2019-12-27 09:37:40,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f19c692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:40, skipping insertion in model container [2019-12-27 09:37:40,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:40" (3/3) ... [2019-12-27 09:37:40,188 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_rmo.opt.i [2019-12-27 09:37:40,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 09:37:40,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 09:37:40,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 09:37:40,209 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 09:37:40,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,297 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,327 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,335 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,336 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:37:40,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 09:37:40,376 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 09:37:40,376 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 09:37:40,376 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 09:37:40,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 09:37:40,377 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 09:37:40,377 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 09:37:40,377 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 09:37:40,377 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 09:37:40,392 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 229 transitions [2019-12-27 09:37:48,856 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80074 states. [2019-12-27 09:37:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 80074 states. [2019-12-27 09:37:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 09:37:48,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:48,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:37:48,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1419186758, now seen corresponding path program 1 times [2019-12-27 09:37:48,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:48,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155497405] [2019-12-27 09:37:48,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:49,209 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 09:37:49,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155497405] [2019-12-27 09:37:49,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:49,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:37:49,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359705052] [2019-12-27 09:37:49,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:37:49,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:37:49,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:37:49,234 INFO L87 Difference]: Start difference. First operand 80074 states. Second operand 4 states. [2019-12-27 09:37:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:37:51,562 INFO L93 Difference]: Finished difference Result 80714 states and 324639 transitions. [2019-12-27 09:37:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:37:51,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 09:37:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:37:52,085 INFO L225 Difference]: With dead ends: 80714 [2019-12-27 09:37:52,085 INFO L226 Difference]: Without dead ends: 59002 [2019-12-27 09:37:52,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:37:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59002 states. [2019-12-27 09:37:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59002 to 59002. [2019-12-27 09:37:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-12-27 09:37:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 240127 transitions. [2019-12-27 09:37:56,761 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 240127 transitions. Word has length 41 [2019-12-27 09:37:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:37:56,762 INFO L462 AbstractCegarLoop]: Abstraction has 59002 states and 240127 transitions. [2019-12-27 09:37:56,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:37:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 240127 transitions. [2019-12-27 09:37:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 09:37:56,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:37:56,773 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 09:37:56,773 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:37:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:37:56,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1596822137, now seen corresponding path program 1 times [2019-12-27 09:37:56,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:37:56,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264794255] [2019-12-27 09:37:56,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:37:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:37:56,924 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 09:37:56,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264794255] [2019-12-27 09:37:56,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:37:56,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:37:56,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175987894] [2019-12-27 09:37:56,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:37:56,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:37:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:37:56,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:37:56,929 INFO L87 Difference]: Start difference. First operand 59002 states and 240127 transitions. Second operand 5 states. [2019-12-27 09:38:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:00,371 INFO L93 Difference]: Finished difference Result 95596 states and 363718 transitions. [2019-12-27 09:38:00,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:00,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 09:38:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:00,755 INFO L225 Difference]: With dead ends: 95596 [2019-12-27 09:38:00,755 INFO L226 Difference]: Without dead ends: 95044 [2019-12-27 09:38:00,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:38:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95044 states. [2019-12-27 09:38:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95044 to 93166. [2019-12-27 09:38:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93166 states. [2019-12-27 09:38:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93166 states to 93166 states and 356304 transitions. [2019-12-27 09:38:04,438 INFO L78 Accepts]: Start accepts. Automaton has 93166 states and 356304 transitions. Word has length 49 [2019-12-27 09:38:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:04,440 INFO L462 AbstractCegarLoop]: Abstraction has 93166 states and 356304 transitions. [2019-12-27 09:38:04,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 93166 states and 356304 transitions. [2019-12-27 09:38:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 09:38:04,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:04,448 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] [2019-12-27 09:38:04,448 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1178649803, now seen corresponding path program 1 times [2019-12-27 09:38:04,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:04,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545184833] [2019-12-27 09:38:04,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:38:04,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545184833] [2019-12-27 09:38:04,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:04,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:38:04,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795340717] [2019-12-27 09:38:04,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:38:04,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:38:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:38:04,578 INFO L87 Difference]: Start difference. First operand 93166 states and 356304 transitions. Second operand 5 states. [2019-12-27 09:38:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:08,229 INFO L93 Difference]: Finished difference Result 118510 states and 442885 transitions. [2019-12-27 09:38:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:08,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-27 09:38:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:08,584 INFO L225 Difference]: With dead ends: 118510 [2019-12-27 09:38:08,585 INFO L226 Difference]: Without dead ends: 118062 [2019-12-27 09:38:08,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:38:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118062 states. [2019-12-27 09:38:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118062 to 104155. [2019-12-27 09:38:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104155 states. [2019-12-27 09:38:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104155 states to 104155 states and 394238 transitions. [2019-12-27 09:38:12,077 INFO L78 Accepts]: Start accepts. Automaton has 104155 states and 394238 transitions. Word has length 50 [2019-12-27 09:38:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:12,077 INFO L462 AbstractCegarLoop]: Abstraction has 104155 states and 394238 transitions. [2019-12-27 09:38:12,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:38:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 104155 states and 394238 transitions. [2019-12-27 09:38:12,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 09:38:12,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:12,090 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] [2019-12-27 09:38:12,090 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -305372623, now seen corresponding path program 1 times [2019-12-27 09:38:12,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:12,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035496927] [2019-12-27 09:38:12,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:12,157 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 09:38:12,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035496927] [2019-12-27 09:38:12,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:12,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:38:12,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198583611] [2019-12-27 09:38:12,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:38:12,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:12,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:38:12,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:38:12,160 INFO L87 Difference]: Start difference. First operand 104155 states and 394238 transitions. Second operand 3 states. [2019-12-27 09:38:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:16,015 INFO L93 Difference]: Finished difference Result 170913 states and 627060 transitions. [2019-12-27 09:38:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:38:16,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 09:38:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:16,438 INFO L225 Difference]: With dead ends: 170913 [2019-12-27 09:38:16,438 INFO L226 Difference]: Without dead ends: 170913 [2019-12-27 09:38:16,438 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 09:38:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170913 states. [2019-12-27 09:38:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170913 to 157191. [2019-12-27 09:38:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157191 states. [2019-12-27 09:38:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157191 states to 157191 states and 581292 transitions. [2019-12-27 09:38:22,055 INFO L78 Accepts]: Start accepts. Automaton has 157191 states and 581292 transitions. Word has length 52 [2019-12-27 09:38:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:22,056 INFO L462 AbstractCegarLoop]: Abstraction has 157191 states and 581292 transitions. [2019-12-27 09:38:22,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:38:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 157191 states and 581292 transitions. [2019-12-27 09:38:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:38:22,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:22,084 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] [2019-12-27 09:38:22,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1580132604, now seen corresponding path program 1 times [2019-12-27 09:38:22,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:22,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646277995] [2019-12-27 09:38:22,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:22,188 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 09:38:22,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646277995] [2019-12-27 09:38:22,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:22,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:38:22,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197004014] [2019-12-27 09:38:22,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:38:22,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:22,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:38:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:22,190 INFO L87 Difference]: Start difference. First operand 157191 states and 581292 transitions. Second operand 6 states. [2019-12-27 09:38:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:29,347 INFO L93 Difference]: Finished difference Result 212575 states and 766174 transitions. [2019-12-27 09:38:29,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:38:29,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:38:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:29,932 INFO L225 Difference]: With dead ends: 212575 [2019-12-27 09:38:29,932 INFO L226 Difference]: Without dead ends: 212055 [2019-12-27 09:38:29,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 09:38:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212055 states. [2019-12-27 09:38:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212055 to 157973. [2019-12-27 09:38:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157973 states. [2019-12-27 09:38:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157973 states to 157973 states and 584229 transitions. [2019-12-27 09:38:35,861 INFO L78 Accepts]: Start accepts. Automaton has 157973 states and 584229 transitions. Word has length 56 [2019-12-27 09:38:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:35,862 INFO L462 AbstractCegarLoop]: Abstraction has 157973 states and 584229 transitions. [2019-12-27 09:38:35,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:38:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157973 states and 584229 transitions. [2019-12-27 09:38:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:38:35,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:35,883 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] [2019-12-27 09:38:35,883 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash 193567859, now seen corresponding path program 1 times [2019-12-27 09:38:35,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:35,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104156031] [2019-12-27 09:38:35,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:35,939 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 09:38:35,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104156031] [2019-12-27 09:38:35,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:35,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:38:35,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850444754] [2019-12-27 09:38:35,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:38:35,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:38:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:38:35,945 INFO L87 Difference]: Start difference. First operand 157973 states and 584229 transitions. Second operand 3 states. [2019-12-27 09:38:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:41,987 INFO L93 Difference]: Finished difference Result 175833 states and 650717 transitions. [2019-12-27 09:38:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:38:41,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 09:38:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:42,445 INFO L225 Difference]: With dead ends: 175833 [2019-12-27 09:38:42,445 INFO L226 Difference]: Without dead ends: 175833 [2019-12-27 09:38:42,446 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 09:38:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175833 states. [2019-12-27 09:38:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175833 to 166853. [2019-12-27 09:38:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166853 states. [2019-12-27 09:38:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166853 states to 166853 states and 617305 transitions. [2019-12-27 09:38:47,246 INFO L78 Accepts]: Start accepts. Automaton has 166853 states and 617305 transitions. Word has length 56 [2019-12-27 09:38:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:38:47,246 INFO L462 AbstractCegarLoop]: Abstraction has 166853 states and 617305 transitions. [2019-12-27 09:38:47,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:38:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 166853 states and 617305 transitions. [2019-12-27 09:38:47,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:38:47,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:38:47,267 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] [2019-12-27 09:38:47,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:38:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:38:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1320483597, now seen corresponding path program 1 times [2019-12-27 09:38:47,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:38:47,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133210609] [2019-12-27 09:38:47,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:38:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:38:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:38:47,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133210609] [2019-12-27 09:38:47,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:38:47,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:38:47,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772463303] [2019-12-27 09:38:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:38:47,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:38:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:38:47,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:38:47,415 INFO L87 Difference]: Start difference. First operand 166853 states and 617305 transitions. Second operand 6 states. [2019-12-27 09:38:50,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:38:50,191 INFO L93 Difference]: Finished difference Result 213770 states and 787341 transitions. [2019-12-27 09:38:50,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:38:50,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:38:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:38:50,822 INFO L225 Difference]: With dead ends: 213770 [2019-12-27 09:38:50,822 INFO L226 Difference]: Without dead ends: 213770 [2019-12-27 09:38:50,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:38:58,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213770 states. [2019-12-27 09:39:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213770 to 193996. [2019-12-27 09:39:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193996 states. [2019-12-27 09:39:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193996 states to 193996 states and 714237 transitions. [2019-12-27 09:39:03,452 INFO L78 Accepts]: Start accepts. Automaton has 193996 states and 714237 transitions. Word has length 56 [2019-12-27 09:39:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:03,453 INFO L462 AbstractCegarLoop]: Abstraction has 193996 states and 714237 transitions. [2019-12-27 09:39:03,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:39:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 193996 states and 714237 transitions. [2019-12-27 09:39:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:39:03,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:03,481 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] [2019-12-27 09:39:03,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1177532340, now seen corresponding path program 1 times [2019-12-27 09:39:03,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:03,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837990750] [2019-12-27 09:39:03,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:03,591 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 09:39:03,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837990750] [2019-12-27 09:39:03,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:03,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:39:03,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723539225] [2019-12-27 09:39:03,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:39:03,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:03,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:39:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:39:03,593 INFO L87 Difference]: Start difference. First operand 193996 states and 714237 transitions. Second operand 7 states. [2019-12-27 09:39:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:07,464 INFO L93 Difference]: Finished difference Result 277139 states and 986577 transitions. [2019-12-27 09:39:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:39:07,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 09:39:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:08,213 INFO L225 Difference]: With dead ends: 277139 [2019-12-27 09:39:08,213 INFO L226 Difference]: Without dead ends: 277139 [2019-12-27 09:39:08,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:39:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277139 states. [2019-12-27 09:39:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277139 to 222095. [2019-12-27 09:39:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222095 states. [2019-12-27 09:39:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222095 states to 222095 states and 805381 transitions. [2019-12-27 09:39:22,939 INFO L78 Accepts]: Start accepts. Automaton has 222095 states and 805381 transitions. Word has length 56 [2019-12-27 09:39:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:22,939 INFO L462 AbstractCegarLoop]: Abstraction has 222095 states and 805381 transitions. [2019-12-27 09:39:22,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:39:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 222095 states and 805381 transitions. [2019-12-27 09:39:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:39:22,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:22,962 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] [2019-12-27 09:39:22,962 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2065036021, now seen corresponding path program 1 times [2019-12-27 09:39:22,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:22,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093875487] [2019-12-27 09:39:22,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:23,020 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 09:39:23,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093875487] [2019-12-27 09:39:23,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:23,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:39:23,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649108138] [2019-12-27 09:39:23,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:39:23,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:23,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:39:23,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:39:23,022 INFO L87 Difference]: Start difference. First operand 222095 states and 805381 transitions. Second operand 3 states. [2019-12-27 09:39:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:23,956 INFO L93 Difference]: Finished difference Result 176991 states and 632039 transitions. [2019-12-27 09:39:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:39:23,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 09:39:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:30,814 INFO L225 Difference]: With dead ends: 176991 [2019-12-27 09:39:30,815 INFO L226 Difference]: Without dead ends: 176991 [2019-12-27 09:39:30,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 09:39:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176991 states. [2019-12-27 09:39:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176991 to 172179. [2019-12-27 09:39:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172179 states. [2019-12-27 09:39:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172179 states to 172179 states and 617064 transitions. [2019-12-27 09:39:35,492 INFO L78 Accepts]: Start accepts. Automaton has 172179 states and 617064 transitions. Word has length 56 [2019-12-27 09:39:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:35,492 INFO L462 AbstractCegarLoop]: Abstraction has 172179 states and 617064 transitions. [2019-12-27 09:39:35,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:39:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 172179 states and 617064 transitions. [2019-12-27 09:39:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:39:35,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:35,516 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] [2019-12-27 09:39:35,517 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1638616881, now seen corresponding path program 1 times [2019-12-27 09:39:35,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:35,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891966099] [2019-12-27 09:39:35,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:35,625 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 09:39:35,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891966099] [2019-12-27 09:39:35,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:35,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:39:35,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687230779] [2019-12-27 09:39:35,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:39:35,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:35,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:39:35,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:39:35,627 INFO L87 Difference]: Start difference. First operand 172179 states and 617064 transitions. Second operand 6 states. [2019-12-27 09:39:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:38,093 INFO L93 Difference]: Finished difference Result 216118 states and 757197 transitions. [2019-12-27 09:39:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:39:38,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 09:39:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:38,593 INFO L225 Difference]: With dead ends: 216118 [2019-12-27 09:39:38,593 INFO L226 Difference]: Without dead ends: 216118 [2019-12-27 09:39:38,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:39:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216118 states. [2019-12-27 09:39:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216118 to 185519. [2019-12-27 09:39:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185519 states. [2019-12-27 09:39:50,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185519 states to 185519 states and 660439 transitions. [2019-12-27 09:39:50,536 INFO L78 Accepts]: Start accepts. Automaton has 185519 states and 660439 transitions. Word has length 57 [2019-12-27 09:39:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:50,536 INFO L462 AbstractCegarLoop]: Abstraction has 185519 states and 660439 transitions. [2019-12-27 09:39:50,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:39:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185519 states and 660439 transitions. [2019-12-27 09:39:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:39:50,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:50,555 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] [2019-12-27 09:39:50,555 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -751113200, now seen corresponding path program 1 times [2019-12-27 09:39:50,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:50,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642379404] [2019-12-27 09:39:50,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:50,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 09:39:50,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642379404] [2019-12-27 09:39:50,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:50,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:39:50,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389418132] [2019-12-27 09:39:50,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:39:50,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:39:50,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:39:50,616 INFO L87 Difference]: Start difference. First operand 185519 states and 660439 transitions. Second operand 4 states. [2019-12-27 09:39:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:50,772 INFO L93 Difference]: Finished difference Result 24459 states and 76335 transitions. [2019-12-27 09:39:50,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:39:50,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 09:39:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:50,816 INFO L225 Difference]: With dead ends: 24459 [2019-12-27 09:39:50,817 INFO L226 Difference]: Without dead ends: 18440 [2019-12-27 09:39:50,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:39:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18440 states. [2019-12-27 09:39:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18440 to 18193. [2019-12-27 09:39:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18193 states. [2019-12-27 09:39:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18193 states to 18193 states and 54576 transitions. [2019-12-27 09:39:51,089 INFO L78 Accepts]: Start accepts. Automaton has 18193 states and 54576 transitions. Word has length 57 [2019-12-27 09:39:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:51,089 INFO L462 AbstractCegarLoop]: Abstraction has 18193 states and 54576 transitions. [2019-12-27 09:39:51,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:39:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18193 states and 54576 transitions. [2019-12-27 09:39:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:39:51,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:51,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:51,094 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:51,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:51,094 INFO L82 PathProgramCache]: Analyzing trace with hash -914504522, now seen corresponding path program 1 times [2019-12-27 09:39:51,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:51,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663630307] [2019-12-27 09:39:51,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:51,153 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 09:39:51,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663630307] [2019-12-27 09:39:51,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:51,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:39:51,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396716816] [2019-12-27 09:39:51,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:39:51,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:51,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:39:51,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:39:51,155 INFO L87 Difference]: Start difference. First operand 18193 states and 54576 transitions. Second operand 4 states. [2019-12-27 09:39:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:51,503 INFO L93 Difference]: Finished difference Result 23513 states and 70754 transitions. [2019-12-27 09:39:51,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:39:51,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 09:39:51,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:51,557 INFO L225 Difference]: With dead ends: 23513 [2019-12-27 09:39:51,558 INFO L226 Difference]: Without dead ends: 23513 [2019-12-27 09:39:51,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:39:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2019-12-27 09:39:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 21215. [2019-12-27 09:39:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21215 states. [2019-12-27 09:39:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21215 states to 21215 states and 63561 transitions. [2019-12-27 09:39:52,009 INFO L78 Accepts]: Start accepts. Automaton has 21215 states and 63561 transitions. Word has length 66 [2019-12-27 09:39:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:52,009 INFO L462 AbstractCegarLoop]: Abstraction has 21215 states and 63561 transitions. [2019-12-27 09:39:52,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:39:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21215 states and 63561 transitions. [2019-12-27 09:39:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 09:39:52,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:52,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:52,017 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash 828305813, now seen corresponding path program 1 times [2019-12-27 09:39:52,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:52,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716174655] [2019-12-27 09:39:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:52,137 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 09:39:52,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716174655] [2019-12-27 09:39:52,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:52,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:39:52,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484308181] [2019-12-27 09:39:52,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:39:52,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:39:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:39:52,139 INFO L87 Difference]: Start difference. First operand 21215 states and 63561 transitions. Second operand 6 states. [2019-12-27 09:39:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:52,780 INFO L93 Difference]: Finished difference Result 30327 states and 89101 transitions. [2019-12-27 09:39:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:39:52,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 09:39:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:52,823 INFO L225 Difference]: With dead ends: 30327 [2019-12-27 09:39:52,823 INFO L226 Difference]: Without dead ends: 30279 [2019-12-27 09:39:52,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:39:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30279 states. [2019-12-27 09:39:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30279 to 27632. [2019-12-27 09:39:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27632 states. [2019-12-27 09:39:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27632 states to 27632 states and 81448 transitions. [2019-12-27 09:39:54,819 INFO L78 Accepts]: Start accepts. Automaton has 27632 states and 81448 transitions. Word has length 66 [2019-12-27 09:39:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:54,819 INFO L462 AbstractCegarLoop]: Abstraction has 27632 states and 81448 transitions. [2019-12-27 09:39:54,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:39:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 27632 states and 81448 transitions. [2019-12-27 09:39:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-27 09:39:54,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:54,828 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] [2019-12-27 09:39:54,829 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 17339334, now seen corresponding path program 1 times [2019-12-27 09:39:54,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:54,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903359608] [2019-12-27 09:39:54,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:54,865 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 09:39:54,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903359608] [2019-12-27 09:39:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:54,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:39:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066477120] [2019-12-27 09:39:54,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:39:54,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:39:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:39:54,867 INFO L87 Difference]: Start difference. First operand 27632 states and 81448 transitions. Second operand 3 states. [2019-12-27 09:39:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:55,001 INFO L93 Difference]: Finished difference Result 30275 states and 87662 transitions. [2019-12-27 09:39:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:39:55,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-27 09:39:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:55,042 INFO L225 Difference]: With dead ends: 30275 [2019-12-27 09:39:55,042 INFO L226 Difference]: Without dead ends: 30275 [2019-12-27 09:39:55,043 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 09:39:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30275 states. [2019-12-27 09:39:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30275 to 26780. [2019-12-27 09:39:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26780 states. [2019-12-27 09:39:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 76976 transitions. [2019-12-27 09:39:55,394 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 76976 transitions. Word has length 72 [2019-12-27 09:39:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:55,394 INFO L462 AbstractCegarLoop]: Abstraction has 26780 states and 76976 transitions. [2019-12-27 09:39:55,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:39:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 76976 transitions. [2019-12-27 09:39:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 09:39:55,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:55,405 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] [2019-12-27 09:39:55,405 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -709057717, now seen corresponding path program 1 times [2019-12-27 09:39:55,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:55,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124718180] [2019-12-27 09:39:55,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:55,472 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 09:39:55,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124718180] [2019-12-27 09:39:55,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:55,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:39:55,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726258259] [2019-12-27 09:39:55,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:39:55,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:39:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:39:55,474 INFO L87 Difference]: Start difference. First operand 26780 states and 76976 transitions. Second operand 4 states. [2019-12-27 09:39:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:56,201 INFO L93 Difference]: Finished difference Result 35102 states and 101172 transitions. [2019-12-27 09:39:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:39:56,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-27 09:39:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:56,251 INFO L225 Difference]: With dead ends: 35102 [2019-12-27 09:39:56,252 INFO L226 Difference]: Without dead ends: 34679 [2019-12-27 09:39:56,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:39:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34679 states. [2019-12-27 09:39:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34679 to 32876. [2019-12-27 09:39:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32876 states. [2019-12-27 09:39:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32876 states to 32876 states and 94660 transitions. [2019-12-27 09:39:56,976 INFO L78 Accepts]: Start accepts. Automaton has 32876 states and 94660 transitions. Word has length 74 [2019-12-27 09:39:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:56,976 INFO L462 AbstractCegarLoop]: Abstraction has 32876 states and 94660 transitions. [2019-12-27 09:39:56,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:39:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32876 states and 94660 transitions. [2019-12-27 09:39:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 09:39:56,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:56,990 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] [2019-12-27 09:39:56,990 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1788958220, now seen corresponding path program 1 times [2019-12-27 09:39:56,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:56,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730633519] [2019-12-27 09:39:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:57,108 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 09:39:57,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730633519] [2019-12-27 09:39:57,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:57,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:39:57,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053092544] [2019-12-27 09:39:57,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:39:57,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:39:57,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:39:57,111 INFO L87 Difference]: Start difference. First operand 32876 states and 94660 transitions. Second operand 8 states. [2019-12-27 09:39:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:58,226 INFO L93 Difference]: Finished difference Result 37961 states and 107979 transitions. [2019-12-27 09:39:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:39:58,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-12-27 09:39:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:58,280 INFO L225 Difference]: With dead ends: 37961 [2019-12-27 09:39:58,280 INFO L226 Difference]: Without dead ends: 37961 [2019-12-27 09:39:58,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:39:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37961 states. [2019-12-27 09:39:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37961 to 35136. [2019-12-27 09:39:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35136 states. [2019-12-27 09:39:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35136 states to 35136 states and 100533 transitions. [2019-12-27 09:39:59,140 INFO L78 Accepts]: Start accepts. Automaton has 35136 states and 100533 transitions. Word has length 74 [2019-12-27 09:39:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:59,140 INFO L462 AbstractCegarLoop]: Abstraction has 35136 states and 100533 transitions. [2019-12-27 09:39:59,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:39:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35136 states and 100533 transitions. [2019-12-27 09:39:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 09:39:59,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:59,157 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] [2019-12-27 09:39:59,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1618505395, now seen corresponding path program 1 times [2019-12-27 09:39:59,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:59,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754524380] [2019-12-27 09:39:59,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:59,233 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 09:39:59,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754524380] [2019-12-27 09:39:59,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:59,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:39:59,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471567463] [2019-12-27 09:39:59,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:39:59,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:39:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:39:59,235 INFO L87 Difference]: Start difference. First operand 35136 states and 100533 transitions. Second operand 5 states. [2019-12-27 09:39:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:39:59,317 INFO L93 Difference]: Finished difference Result 10800 states and 26832 transitions. [2019-12-27 09:39:59,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:39:59,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 09:39:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:39:59,335 INFO L225 Difference]: With dead ends: 10800 [2019-12-27 09:39:59,336 INFO L226 Difference]: Without dead ends: 9417 [2019-12-27 09:39:59,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:39:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-12-27 09:39:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 7148. [2019-12-27 09:39:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7148 states. [2019-12-27 09:39:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7148 states to 7148 states and 17806 transitions. [2019-12-27 09:39:59,487 INFO L78 Accepts]: Start accepts. Automaton has 7148 states and 17806 transitions. Word has length 74 [2019-12-27 09:39:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:39:59,487 INFO L462 AbstractCegarLoop]: Abstraction has 7148 states and 17806 transitions. [2019-12-27 09:39:59,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:39:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7148 states and 17806 transitions. [2019-12-27 09:39:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:39:59,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:39:59,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:39:59,499 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:39:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:39:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash -59117604, now seen corresponding path program 1 times [2019-12-27 09:39:59,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:39:59,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224770995] [2019-12-27 09:39:59,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:39:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:39:59,603 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 09:39:59,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224770995] [2019-12-27 09:39:59,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:39:59,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:39:59,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97398045] [2019-12-27 09:39:59,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:39:59,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:39:59,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:39:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:39:59,605 INFO L87 Difference]: Start difference. First operand 7148 states and 17806 transitions. Second operand 7 states. [2019-12-27 09:40:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:00,672 INFO L93 Difference]: Finished difference Result 13527 states and 32836 transitions. [2019-12-27 09:40:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 09:40:00,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-27 09:40:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:00,689 INFO L225 Difference]: With dead ends: 13527 [2019-12-27 09:40:00,689 INFO L226 Difference]: Without dead ends: 13505 [2019-12-27 09:40:00,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:40:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13505 states. [2019-12-27 09:40:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13505 to 11870. [2019-12-27 09:40:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11870 states. [2019-12-27 09:40:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11870 states to 11870 states and 29125 transitions. [2019-12-27 09:40:00,834 INFO L78 Accepts]: Start accepts. Automaton has 11870 states and 29125 transitions. Word has length 103 [2019-12-27 09:40:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:00,834 INFO L462 AbstractCegarLoop]: Abstraction has 11870 states and 29125 transitions. [2019-12-27 09:40:00,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:40:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11870 states and 29125 transitions. [2019-12-27 09:40:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:00,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:00,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:00,850 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -70433731, now seen corresponding path program 1 times [2019-12-27 09:40:00,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:00,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217402543] [2019-12-27 09:40:00,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:00,922 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 09:40:00,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217402543] [2019-12-27 09:40:00,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:00,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:40:00,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981437283] [2019-12-27 09:40:00,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:40:00,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:00,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:40:00,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:40:00,924 INFO L87 Difference]: Start difference. First operand 11870 states and 29125 transitions. Second operand 4 states. [2019-12-27 09:40:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:01,189 INFO L93 Difference]: Finished difference Result 13187 states and 31833 transitions. [2019-12-27 09:40:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:40:01,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:40:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:01,211 INFO L225 Difference]: With dead ends: 13187 [2019-12-27 09:40:01,211 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 09:40:01,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:40:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 09:40:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 12573. [2019-12-27 09:40:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12573 states. [2019-12-27 09:40:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12573 states to 12573 states and 30516 transitions. [2019-12-27 09:40:01,418 INFO L78 Accepts]: Start accepts. Automaton has 12573 states and 30516 transitions. Word has length 103 [2019-12-27 09:40:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:01,419 INFO L462 AbstractCegarLoop]: Abstraction has 12573 states and 30516 transitions. [2019-12-27 09:40:01,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:40:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12573 states and 30516 transitions. [2019-12-27 09:40:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:01,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:01,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:01,432 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:01,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2069221445, now seen corresponding path program 1 times [2019-12-27 09:40:01,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:01,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267552139] [2019-12-27 09:40:01,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:01,552 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 09:40:01,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267552139] [2019-12-27 09:40:01,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:01,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:40:01,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851396759] [2019-12-27 09:40:01,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:40:01,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:40:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:40:01,555 INFO L87 Difference]: Start difference. First operand 12573 states and 30516 transitions. Second operand 7 states. [2019-12-27 09:40:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:02,206 INFO L93 Difference]: Finished difference Result 17481 states and 40719 transitions. [2019-12-27 09:40:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:40:02,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-27 09:40:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:02,227 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 09:40:02,227 INFO L226 Difference]: Without dead ends: 17481 [2019-12-27 09:40:02,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:40:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17481 states. [2019-12-27 09:40:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17481 to 14867. [2019-12-27 09:40:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14867 states. [2019-12-27 09:40:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14867 states to 14867 states and 35132 transitions. [2019-12-27 09:40:02,575 INFO L78 Accepts]: Start accepts. Automaton has 14867 states and 35132 transitions. Word has length 103 [2019-12-27 09:40:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:02,575 INFO L462 AbstractCegarLoop]: Abstraction has 14867 states and 35132 transitions. [2019-12-27 09:40:02,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:40:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14867 states and 35132 transitions. [2019-12-27 09:40:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:02,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:02,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:02,588 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1971009306, now seen corresponding path program 1 times [2019-12-27 09:40:02,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:02,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781685475] [2019-12-27 09:40:02,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:02,660 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 09:40:02,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781685475] [2019-12-27 09:40:02,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:02,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:40:02,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140699939] [2019-12-27 09:40:02,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:40:02,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:40:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:40:02,662 INFO L87 Difference]: Start difference. First operand 14867 states and 35132 transitions. Second operand 4 states. [2019-12-27 09:40:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:02,727 INFO L93 Difference]: Finished difference Result 14822 states and 35009 transitions. [2019-12-27 09:40:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:40:02,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:40:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:02,749 INFO L225 Difference]: With dead ends: 14822 [2019-12-27 09:40:02,749 INFO L226 Difference]: Without dead ends: 14822 [2019-12-27 09:40:02,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:40:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14822 states. [2019-12-27 09:40:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14822 to 14501. [2019-12-27 09:40:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14501 states. [2019-12-27 09:40:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14501 states to 14501 states and 34280 transitions. [2019-12-27 09:40:02,929 INFO L78 Accepts]: Start accepts. Automaton has 14501 states and 34280 transitions. Word has length 103 [2019-12-27 09:40:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:02,930 INFO L462 AbstractCegarLoop]: Abstraction has 14501 states and 34280 transitions. [2019-12-27 09:40:02,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:40:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14501 states and 34280 transitions. [2019-12-27 09:40:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:02,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:02,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:02,944 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:02,944 INFO L82 PathProgramCache]: Analyzing trace with hash -336476230, now seen corresponding path program 1 times [2019-12-27 09:40:02,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:02,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145565375] [2019-12-27 09:40:02,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:03,011 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 09:40:03,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145565375] [2019-12-27 09:40:03,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:03,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:40:03,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305451676] [2019-12-27 09:40:03,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:40:03,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:40:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:40:03,013 INFO L87 Difference]: Start difference. First operand 14501 states and 34280 transitions. Second operand 4 states. [2019-12-27 09:40:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:03,210 INFO L93 Difference]: Finished difference Result 14577 states and 34470 transitions. [2019-12-27 09:40:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:40:03,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-27 09:40:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:03,228 INFO L225 Difference]: With dead ends: 14577 [2019-12-27 09:40:03,228 INFO L226 Difference]: Without dead ends: 14577 [2019-12-27 09:40:03,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:40:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2019-12-27 09:40:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 13987. [2019-12-27 09:40:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13987 states. [2019-12-27 09:40:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13987 states to 13987 states and 33135 transitions. [2019-12-27 09:40:03,373 INFO L78 Accepts]: Start accepts. Automaton has 13987 states and 33135 transitions. Word has length 103 [2019-12-27 09:40:03,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:03,374 INFO L462 AbstractCegarLoop]: Abstraction has 13987 states and 33135 transitions. [2019-12-27 09:40:03,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:40:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13987 states and 33135 transitions. [2019-12-27 09:40:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:03,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:03,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:03,386 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1879253812, now seen corresponding path program 2 times [2019-12-27 09:40:03,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:03,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137506546] [2019-12-27 09:40:03,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:03,521 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 09:40:03,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137506546] [2019-12-27 09:40:03,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:03,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:40:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183278073] [2019-12-27 09:40:03,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:40:03,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:40:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:40:03,524 INFO L87 Difference]: Start difference. First operand 13987 states and 33135 transitions. Second operand 7 states. [2019-12-27 09:40:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:03,848 INFO L93 Difference]: Finished difference Result 14502 states and 34226 transitions. [2019-12-27 09:40:03,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:40:03,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2019-12-27 09:40:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:03,867 INFO L225 Difference]: With dead ends: 14502 [2019-12-27 09:40:03,867 INFO L226 Difference]: Without dead ends: 14502 [2019-12-27 09:40:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:40:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14502 states. [2019-12-27 09:40:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14502 to 14381. [2019-12-27 09:40:04,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14381 states. [2019-12-27 09:40:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14381 states to 14381 states and 33990 transitions. [2019-12-27 09:40:04,031 INFO L78 Accepts]: Start accepts. Automaton has 14381 states and 33990 transitions. Word has length 103 [2019-12-27 09:40:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:04,031 INFO L462 AbstractCegarLoop]: Abstraction has 14381 states and 33990 transitions. [2019-12-27 09:40:04,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:40:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14381 states and 33990 transitions. [2019-12-27 09:40:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:04,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:04,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:04,045 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1528209803, now seen corresponding path program 1 times [2019-12-27 09:40:04,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:04,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851716755] [2019-12-27 09:40:04,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:04,097 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 09:40:04,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851716755] [2019-12-27 09:40:04,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:04,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:40:04,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273402216] [2019-12-27 09:40:04,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:40:04,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:40:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:40:04,099 INFO L87 Difference]: Start difference. First operand 14381 states and 33990 transitions. Second operand 3 states. [2019-12-27 09:40:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:04,168 INFO L93 Difference]: Finished difference Result 17223 states and 40607 transitions. [2019-12-27 09:40:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:40:04,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-27 09:40:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:04,197 INFO L225 Difference]: With dead ends: 17223 [2019-12-27 09:40:04,197 INFO L226 Difference]: Without dead ends: 17223 [2019-12-27 09:40:04,198 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 09:40:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17223 states. [2019-12-27 09:40:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17223 to 17159. [2019-12-27 09:40:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17159 states. [2019-12-27 09:40:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17159 states to 17159 states and 40469 transitions. [2019-12-27 09:40:04,783 INFO L78 Accepts]: Start accepts. Automaton has 17159 states and 40469 transitions. Word has length 103 [2019-12-27 09:40:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:04,784 INFO L462 AbstractCegarLoop]: Abstraction has 17159 states and 40469 transitions. [2019-12-27 09:40:04,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:40:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 17159 states and 40469 transitions. [2019-12-27 09:40:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:04,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:04,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:04,816 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1316858890, now seen corresponding path program 1 times [2019-12-27 09:40:04,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:04,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832758269] [2019-12-27 09:40:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:04,910 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 09:40:04,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832758269] [2019-12-27 09:40:04,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:04,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:40:04,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202793574] [2019-12-27 09:40:04,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:40:04,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:40:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:40:04,912 INFO L87 Difference]: Start difference. First operand 17159 states and 40469 transitions. Second operand 5 states. [2019-12-27 09:40:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:05,346 INFO L93 Difference]: Finished difference Result 18164 states and 42570 transitions. [2019-12-27 09:40:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:40:05,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-27 09:40:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:05,370 INFO L225 Difference]: With dead ends: 18164 [2019-12-27 09:40:05,370 INFO L226 Difference]: Without dead ends: 18164 [2019-12-27 09:40:05,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:40:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18164 states. [2019-12-27 09:40:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18164 to 17126. [2019-12-27 09:40:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17126 states. [2019-12-27 09:40:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17126 states to 17126 states and 40335 transitions. [2019-12-27 09:40:05,551 INFO L78 Accepts]: Start accepts. Automaton has 17126 states and 40335 transitions. Word has length 103 [2019-12-27 09:40:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:05,551 INFO L462 AbstractCegarLoop]: Abstraction has 17126 states and 40335 transitions. [2019-12-27 09:40:05,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:40:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 17126 states and 40335 transitions. [2019-12-27 09:40:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:05,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:05,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:05,567 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:05,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash -395452766, now seen corresponding path program 2 times [2019-12-27 09:40:05,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:05,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201150793] [2019-12-27 09:40:05,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:05,662 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 09:40:05,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201150793] [2019-12-27 09:40:05,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:05,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:40:05,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277069720] [2019-12-27 09:40:05,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:40:05,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:05,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:40:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:40:05,664 INFO L87 Difference]: Start difference. First operand 17126 states and 40335 transitions. Second operand 6 states. [2019-12-27 09:40:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:06,270 INFO L93 Difference]: Finished difference Result 20303 states and 47575 transitions. [2019-12-27 09:40:06,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:40:06,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-12-27 09:40:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:06,308 INFO L225 Difference]: With dead ends: 20303 [2019-12-27 09:40:06,308 INFO L226 Difference]: Without dead ends: 20303 [2019-12-27 09:40:06,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:40:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20303 states. [2019-12-27 09:40:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20303 to 17161. [2019-12-27 09:40:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17161 states. [2019-12-27 09:40:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17161 states to 17161 states and 40411 transitions. [2019-12-27 09:40:06,661 INFO L78 Accepts]: Start accepts. Automaton has 17161 states and 40411 transitions. Word has length 103 [2019-12-27 09:40:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:06,662 INFO L462 AbstractCegarLoop]: Abstraction has 17161 states and 40411 transitions. [2019-12-27 09:40:06,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:40:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17161 states and 40411 transitions. [2019-12-27 09:40:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-27 09:40:06,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:06,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:06,684 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:06,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:06,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2015950754, now seen corresponding path program 3 times [2019-12-27 09:40:06,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:06,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505376323] [2019-12-27 09:40:06,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:06,743 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 09:40:06,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505376323] [2019-12-27 09:40:06,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:06,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:40:06,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536052010] [2019-12-27 09:40:06,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:40:06,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:06,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:40:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:40:06,745 INFO L87 Difference]: Start difference. First operand 17161 states and 40411 transitions. Second operand 5 states. [2019-12-27 09:40:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:07,162 INFO L93 Difference]: Finished difference Result 19265 states and 44714 transitions. [2019-12-27 09:40:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:40:07,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-12-27 09:40:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:07,192 INFO L225 Difference]: With dead ends: 19265 [2019-12-27 09:40:07,193 INFO L226 Difference]: Without dead ends: 19265 [2019-12-27 09:40:07,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 09:40:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19265 states. [2019-12-27 09:40:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19265 to 17367. [2019-12-27 09:40:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2019-12-27 09:40:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 40837 transitions. [2019-12-27 09:40:07,575 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 40837 transitions. Word has length 103 [2019-12-27 09:40:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:07,575 INFO L462 AbstractCegarLoop]: Abstraction has 17367 states and 40837 transitions. [2019-12-27 09:40:07,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:40:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 40837 transitions. [2019-12-27 09:40:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:40:07,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:07,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:07,598 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1862635831, now seen corresponding path program 1 times [2019-12-27 09:40:07,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010625418] [2019-12-27 09:40:07,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:07,934 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-27 09:40:08,006 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 09:40:08,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010625418] [2019-12-27 09:40:08,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:08,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:40:08,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512635792] [2019-12-27 09:40:08,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:40:08,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:40:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:40:08,010 INFO L87 Difference]: Start difference. First operand 17367 states and 40837 transitions. Second operand 8 states. [2019-12-27 09:40:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:08,136 INFO L93 Difference]: Finished difference Result 17848 states and 41901 transitions. [2019-12-27 09:40:08,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:40:08,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-27 09:40:08,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:08,142 INFO L225 Difference]: With dead ends: 17848 [2019-12-27 09:40:08,143 INFO L226 Difference]: Without dead ends: 3192 [2019-12-27 09:40:08,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:40:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2019-12-27 09:40:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3190. [2019-12-27 09:40:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-12-27 09:40:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 7499 transitions. [2019-12-27 09:40:08,175 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 7499 transitions. Word has length 105 [2019-12-27 09:40:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:08,175 INFO L462 AbstractCegarLoop]: Abstraction has 3190 states and 7499 transitions. [2019-12-27 09:40:08,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:40:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 7499 transitions. [2019-12-27 09:40:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:40:08,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:08,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:08,179 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 5346034, now seen corresponding path program 1 times [2019-12-27 09:40:08,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:08,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798974237] [2019-12-27 09:40:08,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:08,353 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 09:40:08,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798974237] [2019-12-27 09:40:08,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:08,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:40:08,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257860897] [2019-12-27 09:40:08,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:40:08,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:40:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:40:08,355 INFO L87 Difference]: Start difference. First operand 3190 states and 7499 transitions. Second operand 8 states. [2019-12-27 09:40:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:08,684 INFO L93 Difference]: Finished difference Result 3569 states and 8317 transitions. [2019-12-27 09:40:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:40:08,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-12-27 09:40:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:08,690 INFO L225 Difference]: With dead ends: 3569 [2019-12-27 09:40:08,690 INFO L226 Difference]: Without dead ends: 3547 [2019-12-27 09:40:08,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-27 09:40:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2019-12-27 09:40:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3230. [2019-12-27 09:40:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2019-12-27 09:40:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 7580 transitions. [2019-12-27 09:40:08,722 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 7580 transitions. Word has length 105 [2019-12-27 09:40:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:08,722 INFO L462 AbstractCegarLoop]: Abstraction has 3230 states and 7580 transitions. [2019-12-27 09:40:08,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:40:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 7580 transitions. [2019-12-27 09:40:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:40:08,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:08,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:08,725 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 892849715, now seen corresponding path program 1 times [2019-12-27 09:40:08,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:08,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956488405] [2019-12-27 09:40:08,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:08,834 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 09:40:08,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956488405] [2019-12-27 09:40:08,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:08,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:40:08,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238623387] [2019-12-27 09:40:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:40:08,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:40:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:40:08,836 INFO L87 Difference]: Start difference. First operand 3230 states and 7580 transitions. Second operand 7 states. [2019-12-27 09:40:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:09,222 INFO L93 Difference]: Finished difference Result 3597 states and 8500 transitions. [2019-12-27 09:40:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:40:09,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-12-27 09:40:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:09,227 INFO L225 Difference]: With dead ends: 3597 [2019-12-27 09:40:09,227 INFO L226 Difference]: Without dead ends: 3597 [2019-12-27 09:40:09,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:40:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2019-12-27 09:40:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3183. [2019-12-27 09:40:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-27 09:40:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 7473 transitions. [2019-12-27 09:40:09,279 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 7473 transitions. Word has length 105 [2019-12-27 09:40:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:09,279 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 7473 transitions. [2019-12-27 09:40:09,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:40:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 7473 transitions. [2019-12-27 09:40:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:40:09,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:09,284 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -582979528, now seen corresponding path program 1 times [2019-12-27 09:40:09,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:09,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869257596] [2019-12-27 09:40:09,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:40:09,442 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 09:40:09,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869257596] [2019-12-27 09:40:09,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:40:09,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 09:40:09,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926318311] [2019-12-27 09:40:09,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 09:40:09,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:40:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 09:40:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 09:40:09,445 INFO L87 Difference]: Start difference. First operand 3183 states and 7473 transitions. Second operand 11 states. [2019-12-27 09:40:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:40:09,823 INFO L93 Difference]: Finished difference Result 5028 states and 11536 transitions. [2019-12-27 09:40:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:40:09,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-12-27 09:40:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:40:09,828 INFO L225 Difference]: With dead ends: 5028 [2019-12-27 09:40:09,829 INFO L226 Difference]: Without dead ends: 3642 [2019-12-27 09:40:09,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 09:40:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2019-12-27 09:40:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3238. [2019-12-27 09:40:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3238 states. [2019-12-27 09:40:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 7534 transitions. [2019-12-27 09:40:09,860 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 7534 transitions. Word has length 105 [2019-12-27 09:40:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:40:09,860 INFO L462 AbstractCegarLoop]: Abstraction has 3238 states and 7534 transitions. [2019-12-27 09:40:09,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 09:40:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 7534 transitions. [2019-12-27 09:40:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-27 09:40:09,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:40:09,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:40:09,864 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:40:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:40:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash -633160074, now seen corresponding path program 2 times [2019-12-27 09:40:09,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:40:09,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388055836] [2019-12-27 09:40:09,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:40:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:40:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:40:09,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:40:09,963 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:40:10,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:40:10 BasicIcfg [2019-12-27 09:40:10,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:40:10,209 INFO L168 Benchmark]: Toolchain (without parser) took 151803.39 ms. Allocated memory was 144.7 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 958.2 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,210 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.43 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.0 MB in the beginning and 154.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.38 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,211 INFO L168 Benchmark]: Boogie Preprocessor took 43.30 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,212 INFO L168 Benchmark]: RCFGBuilder took 885.19 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 95.9 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,212 INFO L168 Benchmark]: TraceAbstraction took 150026.82 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 95.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 896.5 MB. Max. memory is 7.1 GB. [2019-12-27 09:40:10,215 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.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.43 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.0 MB in the beginning and 154.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.38 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 151.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.30 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 149.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 885.19 ms. Allocated memory is still 201.3 MB. Free memory was 148.4 MB in the beginning and 95.9 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150026.82 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 95.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 896.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L718] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L719] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L720] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L721] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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, z=0] [L726] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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, z=0] [L727] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L817] 0 pthread_t t251; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t251, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L819] 0 pthread_t t252; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L820] FCALL, FORK 0 pthread_create(&t252, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L765] 2 y$w_buff1 = y$w_buff0 [L766] 2 y$w_buff0 = 1 [L767] 2 y$w_buff1_used = y$w_buff0_used [L768] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L770] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = (_Bool)1 [L776] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 2 y$flush_delayed = weak$$choice2 [L779] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 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) [L781] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 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)) [L782] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 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)) [L783] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 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)) [L784] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 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)) [L785] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 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)) [L786] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 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)) [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 2 y = y$flush_delayed ? y$mem_tmp : y [L789] 2 y$flush_delayed = (_Bool)0 [L792] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 1 z = 1 [L734] 1 x = 1 [L737] 1 __unbuffered_p0_EAX = x [L740] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L741] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L742] 1 y$flush_delayed = weak$$choice2 [L743] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 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) [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 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 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 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 [L833] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 2 error locations. Result: UNSAFE, OverallTime: 149.5s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 57.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10956 SDtfs, 12118 SDslu, 23230 SDs, 0 SdLazy, 9179 SolverSat, 560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 82 SyntacticMatches, 21 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222095occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 79.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 231492 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2567 NumberOfCodeBlocks, 2567 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2431 ConstructedInterpolants, 0 QuantifiedInterpolants, 497992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...