/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:03:10,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:03:10,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:03:10,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:03:10,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:03:10,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:03:10,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:03:10,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:03:10,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:03:10,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:03:10,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:03:10,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:03:10,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:03:10,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:03:10,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:03:10,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:03:10,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:03:10,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:03:10,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:03:10,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:03:10,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:03:10,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:03:10,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:03:10,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:03:10,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:03:10,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:03:10,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:03:10,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:03:10,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:03:10,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:03:10,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:03:10,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:03:10,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:03:10,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:03:10,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:03:10,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:03:10,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:03:10,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:03:10,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:03:10,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:03:10,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:03:10,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:03:10,143 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:03:10,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:03:10,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:03:10,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:03:10,149 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:03:10,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:03:10,149 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:03:10,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:03:10,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:03:10,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:03:10,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:03:10,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:03:10,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:03:10,151 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:03:10,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:03:10,151 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:03:10,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:03:10,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:03:10,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:03:10,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:03:10,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:03:10,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:03:10,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:03:10,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:03:10,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:03:10,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:03:10,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:03:10,522 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:03:10,522 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:03:10,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.opt.i [2020-10-21 23:03:10,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3923c04/25a4bea860ef4f35b0419d06f6ba2609/FLAG2f9a72f15 [2020-10-21 23:03:11,163 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:03:11,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_rmo.opt.i [2020-10-21 23:03:11,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3923c04/25a4bea860ef4f35b0419d06f6ba2609/FLAG2f9a72f15 [2020-10-21 23:03:11,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3923c04/25a4bea860ef4f35b0419d06f6ba2609 [2020-10-21 23:03:11,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:03:11,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:03:11,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:03:11,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:03:11,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:03:11,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:03:11" (1/1) ... [2020-10-21 23:03:11,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e7e8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:11, skipping insertion in model container [2020-10-21 23:03:11,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:03:11" (1/1) ... [2020-10-21 23:03:11,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:03:11,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:03:12,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:03:12,083 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:03:12,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:03:12,235 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:03:12,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12 WrapperNode [2020-10-21 23:03:12,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:03:12,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:03:12,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:03:12,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:03:12,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:03:12,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:03:12,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:03:12,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:03:12,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (1/1) ... [2020-10-21 23:03:12,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:03:12,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:03:12,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:03:12,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:03:12,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (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 [2020-10-21 23:03:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-21 23:03:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:03:12,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:03:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:03:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:03:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:03:12,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:03:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:03:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:03:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:03:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:03:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:03:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:03:12,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:03:12,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:03:12,458 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:03:15,197 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:03:15,197 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-21 23:03:15,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:03:15 BoogieIcfgContainer [2020-10-21 23:03:15,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:03:15,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:03:15,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:03:15,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:03:15,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:03:11" (1/3) ... [2020-10-21 23:03:15,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55ba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:03:15, skipping insertion in model container [2020-10-21 23:03:15,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:03:12" (2/3) ... [2020-10-21 23:03:15,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d55ba2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:03:15, skipping insertion in model container [2020-10-21 23:03:15,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:03:15" (3/3) ... [2020-10-21 23:03:15,209 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.opt.i [2020-10-21 23:03:15,222 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:03:15,222 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:03:15,233 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-21 23:03:15,234 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:03:15,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,282 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,284 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,311 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,311 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,321 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,328 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,337 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:03:15,354 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:03:15,368 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-21 23:03:15,385 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:03:15,386 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:03:15,386 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:03:15,386 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:03:15,386 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:03:15,386 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:03:15,386 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:03:15,386 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:03:15,401 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:03:15,402 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-21 23:03:15,405 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 117 transitions, 249 flow [2020-10-21 23:03:15,407 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2020-10-21 23:03:15,464 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-10-21 23:03:15,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:03:15,469 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-21 23:03:15,473 INFO L116 LiptonReduction]: Number of co-enabled transitions 1570 [2020-10-21 23:03:16,421 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-21 23:03:16,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-21 23:03:16,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:03:16,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-21 23:03:16,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:03:17,636 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-21 23:03:17,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-21 23:03:17,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 23:03:18,280 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-21 23:03:18,685 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-21 23:03:18,839 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-21 23:03:19,686 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-21 23:03:20,368 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-21 23:03:20,475 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-21 23:03:20,604 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-21 23:03:20,725 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-21 23:03:21,458 WARN L193 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 159 [2020-10-21 23:03:21,796 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2020-10-21 23:03:21,803 INFO L131 LiptonReduction]: Checked pairs total: 4048 [2020-10-21 23:03:21,803 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-10-21 23:03:21,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-21 23:03:21,853 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 610 states. [2020-10-21 23:03:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states. [2020-10-21 23:03:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:03:21,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:21,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:21,872 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1781576597, now seen corresponding path program 1 times [2020-10-21 23:03:21,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:21,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491596205] [2020-10-21 23:03:21,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:22,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491596205] [2020-10-21 23:03:22,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:22,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:03:22,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279498968] [2020-10-21 23:03:22,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-21 23:03:22,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-21 23:03:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-21 23:03:22,164 INFO L87 Difference]: Start difference. First operand 610 states. Second operand 2 states. [2020-10-21 23:03:22,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:22,221 INFO L93 Difference]: Finished difference Result 610 states and 1886 transitions. [2020-10-21 23:03:22,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-21 23:03:22,223 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-21 23:03:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:22,253 INFO L225 Difference]: With dead ends: 610 [2020-10-21 23:03:22,253 INFO L226 Difference]: Without dead ends: 450 [2020-10-21 23:03:22,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-21 23:03:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-21 23:03:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-21 23:03:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-21 23:03:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-21 23:03:22,369 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 10 [2020-10-21 23:03:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:22,370 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-21 23:03:22,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-21 23:03:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-21 23:03:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:03:22,373 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:22,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:22,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:03:22,373 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1781193158, now seen corresponding path program 1 times [2020-10-21 23:03:22,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:22,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386729322] [2020-10-21 23:03:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:22,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386729322] [2020-10-21 23:03:22,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:22,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:03:22,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43185761] [2020-10-21 23:03:22,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:03:22,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:03:22,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:03:22,596 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 4 states. [2020-10-21 23:03:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:22,632 INFO L93 Difference]: Finished difference Result 466 states and 1350 transitions. [2020-10-21 23:03:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:03:22,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 23:03:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:22,636 INFO L225 Difference]: With dead ends: 466 [2020-10-21 23:03:22,636 INFO L226 Difference]: Without dead ends: 386 [2020-10-21 23:03:22,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:03:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-10-21 23:03:22,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2020-10-21 23:03:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-21 23:03:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1134 transitions. [2020-10-21 23:03:22,655 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1134 transitions. Word has length 10 [2020-10-21 23:03:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:22,655 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1134 transitions. [2020-10-21 23:03:22,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:03:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1134 transitions. [2020-10-21 23:03:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:03:22,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:22,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:22,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:03:22,659 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1837494718, now seen corresponding path program 1 times [2020-10-21 23:03:22,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:22,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339641658] [2020-10-21 23:03:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:22,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339641658] [2020-10-21 23:03:22,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:22,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:03:22,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423922635] [2020-10-21 23:03:22,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:03:22,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:22,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:03:22,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:03:22,793 INFO L87 Difference]: Start difference. First operand 386 states and 1134 transitions. Second operand 4 states. [2020-10-21 23:03:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:22,833 INFO L93 Difference]: Finished difference Result 410 states and 1168 transitions. [2020-10-21 23:03:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:03:22,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:03:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:22,836 INFO L225 Difference]: With dead ends: 410 [2020-10-21 23:03:22,837 INFO L226 Difference]: Without dead ends: 362 [2020-10-21 23:03:22,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:03:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-10-21 23:03:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2020-10-21 23:03:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-21 23:03:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1052 transitions. [2020-10-21 23:03:22,850 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1052 transitions. Word has length 12 [2020-10-21 23:03:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:22,850 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 1052 transitions. [2020-10-21 23:03:22,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:03:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1052 transitions. [2020-10-21 23:03:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:03:22,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:22,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:22,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:03:22,853 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash 747092829, now seen corresponding path program 1 times [2020-10-21 23:03:22,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:22,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57639662] [2020-10-21 23:03:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:23,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57639662] [2020-10-21 23:03:23,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:23,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:03:23,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150137398] [2020-10-21 23:03:23,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:03:23,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:03:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:03:23,208 INFO L87 Difference]: Start difference. First operand 362 states and 1052 transitions. Second operand 9 states. [2020-10-21 23:03:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:23,593 INFO L93 Difference]: Finished difference Result 428 states and 1187 transitions. [2020-10-21 23:03:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:03:23,595 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-10-21 23:03:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:23,598 INFO L225 Difference]: With dead ends: 428 [2020-10-21 23:03:23,598 INFO L226 Difference]: Without dead ends: 390 [2020-10-21 23:03:23,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:03:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2020-10-21 23:03:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2020-10-21 23:03:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-21 23:03:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1100 transitions. [2020-10-21 23:03:23,611 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1100 transitions. Word has length 13 [2020-10-21 23:03:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:23,612 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 1100 transitions. [2020-10-21 23:03:23,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:03:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1100 transitions. [2020-10-21 23:03:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:03:23,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:23,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:23,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:03:23,614 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1253166791, now seen corresponding path program 1 times [2020-10-21 23:03:23,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:23,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950543136] [2020-10-21 23:03:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:23,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950543136] [2020-10-21 23:03:23,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:23,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:03:23,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272242478] [2020-10-21 23:03:23,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:03:23,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:03:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:03:23,712 INFO L87 Difference]: Start difference. First operand 390 states and 1100 transitions. Second operand 4 states. [2020-10-21 23:03:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:23,745 INFO L93 Difference]: Finished difference Result 386 states and 975 transitions. [2020-10-21 23:03:23,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:03:23,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:03:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:23,749 INFO L225 Difference]: With dead ends: 386 [2020-10-21 23:03:23,749 INFO L226 Difference]: Without dead ends: 302 [2020-10-21 23:03:23,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:03:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-21 23:03:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-21 23:03:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-21 23:03:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 748 transitions. [2020-10-21 23:03:23,759 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 748 transitions. Word has length 14 [2020-10-21 23:03:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:23,760 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 748 transitions. [2020-10-21 23:03:23,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:03:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 748 transitions. [2020-10-21 23:03:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:03:23,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:23,761 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:23,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:03:23,761 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2145964634, now seen corresponding path program 1 times [2020-10-21 23:03:23,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:23,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255688480] [2020-10-21 23:03:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:23,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255688480] [2020-10-21 23:03:23,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:23,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:03:23,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34561474] [2020-10-21 23:03:23,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:03:23,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:03:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:03:23,997 INFO L87 Difference]: Start difference. First operand 302 states and 748 transitions. Second operand 9 states. [2020-10-21 23:03:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:24,328 INFO L93 Difference]: Finished difference Result 312 states and 760 transitions. [2020-10-21 23:03:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:03:24,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-21 23:03:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:24,334 INFO L225 Difference]: With dead ends: 312 [2020-10-21 23:03:24,336 INFO L226 Difference]: Without dead ends: 300 [2020-10-21 23:03:24,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:03:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-10-21 23:03:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 284. [2020-10-21 23:03:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-10-21 23:03:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 705 transitions. [2020-10-21 23:03:24,356 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 705 transitions. Word has length 15 [2020-10-21 23:03:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:24,358 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 705 transitions. [2020-10-21 23:03:24,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:03:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 705 transitions. [2020-10-21 23:03:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:03:24,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:24,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:24,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:03:24,360 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:24,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash 561635534, now seen corresponding path program 1 times [2020-10-21 23:03:24,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:24,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974973240] [2020-10-21 23:03:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:24,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974973240] [2020-10-21 23:03:24,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:24,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:03:24,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126269662] [2020-10-21 23:03:24,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:03:24,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:03:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:03:24,576 INFO L87 Difference]: Start difference. First operand 284 states and 705 transitions. Second operand 7 states. [2020-10-21 23:03:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:24,869 INFO L93 Difference]: Finished difference Result 523 states and 1252 transitions. [2020-10-21 23:03:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:03:24,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-21 23:03:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:24,874 INFO L225 Difference]: With dead ends: 523 [2020-10-21 23:03:24,874 INFO L226 Difference]: Without dead ends: 453 [2020-10-21 23:03:24,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:03:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2020-10-21 23:03:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 308. [2020-10-21 23:03:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-10-21 23:03:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 763 transitions. [2020-10-21 23:03:24,889 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 763 transitions. Word has length 15 [2020-10-21 23:03:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:24,889 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 763 transitions. [2020-10-21 23:03:24,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:03:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 763 transitions. [2020-10-21 23:03:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:03:24,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:24,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:24,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:03:24,891 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 651913874, now seen corresponding path program 2 times [2020-10-21 23:03:24,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:24,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156414802] [2020-10-21 23:03:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:25,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156414802] [2020-10-21 23:03:25,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:25,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:03:25,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79070627] [2020-10-21 23:03:25,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:03:25,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:03:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:03:25,156 INFO L87 Difference]: Start difference. First operand 308 states and 763 transitions. Second operand 8 states. [2020-10-21 23:03:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:25,665 INFO L93 Difference]: Finished difference Result 485 states and 1166 transitions. [2020-10-21 23:03:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:03:25,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:03:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:25,676 INFO L225 Difference]: With dead ends: 485 [2020-10-21 23:03:25,676 INFO L226 Difference]: Without dead ends: 473 [2020-10-21 23:03:25,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:03:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-10-21 23:03:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 302. [2020-10-21 23:03:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-21 23:03:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 747 transitions. [2020-10-21 23:03:25,687 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 747 transitions. Word has length 15 [2020-10-21 23:03:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:25,688 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 747 transitions. [2020-10-21 23:03:25,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:03:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 747 transitions. [2020-10-21 23:03:25,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:03:25,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:25,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:25,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:03:25,690 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:25,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:25,690 INFO L82 PathProgramCache]: Analyzing trace with hash 673915776, now seen corresponding path program 3 times [2020-10-21 23:03:25,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:25,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348836111] [2020-10-21 23:03:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:26,158 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-10-21 23:03:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:26,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348836111] [2020-10-21 23:03:26,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:26,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:03:26,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038184991] [2020-10-21 23:03:26,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:03:26,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:26,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:03:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:03:26,227 INFO L87 Difference]: Start difference. First operand 302 states and 747 transitions. Second operand 9 states. [2020-10-21 23:03:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:26,479 INFO L93 Difference]: Finished difference Result 341 states and 823 transitions. [2020-10-21 23:03:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:03:26,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-21 23:03:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:26,482 INFO L225 Difference]: With dead ends: 341 [2020-10-21 23:03:26,482 INFO L226 Difference]: Without dead ends: 329 [2020-10-21 23:03:26,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:03:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-10-21 23:03:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2020-10-21 23:03:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-10-21 23:03:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 711 transitions. [2020-10-21 23:03:26,493 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 711 transitions. Word has length 15 [2020-10-21 23:03:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:26,493 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 711 transitions. [2020-10-21 23:03:26,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:03:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 711 transitions. [2020-10-21 23:03:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:03:26,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:26,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:26,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:03:26,495 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:26,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1277293058, now seen corresponding path program 1 times [2020-10-21 23:03:26,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:26,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230823771] [2020-10-21 23:03:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:26,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230823771] [2020-10-21 23:03:26,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:26,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:03:26,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014393674] [2020-10-21 23:03:26,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:03:26,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:03:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:03:26,582 INFO L87 Difference]: Start difference. First operand 288 states and 711 transitions. Second operand 5 states. [2020-10-21 23:03:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:26,634 INFO L93 Difference]: Finished difference Result 237 states and 532 transitions. [2020-10-21 23:03:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:03:26,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:03:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:26,636 INFO L225 Difference]: With dead ends: 237 [2020-10-21 23:03:26,637 INFO L226 Difference]: Without dead ends: 186 [2020-10-21 23:03:26,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:03:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-21 23:03:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-21 23:03:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-21 23:03:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 407 transitions. [2020-10-21 23:03:26,643 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 407 transitions. Word has length 16 [2020-10-21 23:03:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:26,643 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 407 transitions. [2020-10-21 23:03:26,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:03:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 407 transitions. [2020-10-21 23:03:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:03:26,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:26,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:26,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:03:26,645 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -458166431, now seen corresponding path program 1 times [2020-10-21 23:03:26,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:26,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835323283] [2020-10-21 23:03:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:26,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835323283] [2020-10-21 23:03:26,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:26,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:03:26,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869160514] [2020-10-21 23:03:26,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:03:26,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:26,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:03:26,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:03:26,868 INFO L87 Difference]: Start difference. First operand 186 states and 407 transitions. Second operand 8 states. [2020-10-21 23:03:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:27,105 INFO L93 Difference]: Finished difference Result 364 states and 786 transitions. [2020-10-21 23:03:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:03:27,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-21 23:03:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:27,109 INFO L225 Difference]: With dead ends: 364 [2020-10-21 23:03:27,109 INFO L226 Difference]: Without dead ends: 335 [2020-10-21 23:03:27,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:03:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2020-10-21 23:03:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 249. [2020-10-21 23:03:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2020-10-21 23:03:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 552 transitions. [2020-10-21 23:03:27,120 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 552 transitions. Word has length 17 [2020-10-21 23:03:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:27,121 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 552 transitions. [2020-10-21 23:03:27,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:03:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 552 transitions. [2020-10-21 23:03:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:03:27,122 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:27,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:27,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:03:27,123 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1042511565, now seen corresponding path program 2 times [2020-10-21 23:03:27,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:27,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698947120] [2020-10-21 23:03:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:27,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:27,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698947120] [2020-10-21 23:03:27,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:27,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:03:27,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044650904] [2020-10-21 23:03:27,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:03:27,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:27,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:03:27,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:03:27,638 INFO L87 Difference]: Start difference. First operand 249 states and 552 transitions. Second operand 12 states. [2020-10-21 23:03:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:27,964 INFO L93 Difference]: Finished difference Result 306 states and 655 transitions. [2020-10-21 23:03:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:03:27,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-10-21 23:03:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:27,968 INFO L225 Difference]: With dead ends: 306 [2020-10-21 23:03:27,969 INFO L226 Difference]: Without dead ends: 302 [2020-10-21 23:03:27,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:03:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-21 23:03:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 259. [2020-10-21 23:03:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-10-21 23:03:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 571 transitions. [2020-10-21 23:03:27,976 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 571 transitions. Word has length 17 [2020-10-21 23:03:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:27,977 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 571 transitions. [2020-10-21 23:03:27,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:03:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 571 transitions. [2020-10-21 23:03:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:03:27,978 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:27,978 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:27,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:03:27,978 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 733230309, now seen corresponding path program 3 times [2020-10-21 23:03:27,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:27,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170630231] [2020-10-21 23:03:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:28,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170630231] [2020-10-21 23:03:28,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:28,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:03:28,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3549275] [2020-10-21 23:03:28,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:03:28,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:28,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:03:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:03:28,196 INFO L87 Difference]: Start difference. First operand 259 states and 571 transitions. Second operand 8 states. [2020-10-21 23:03:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:28,530 INFO L93 Difference]: Finished difference Result 341 states and 736 transitions. [2020-10-21 23:03:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:03:28,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-21 23:03:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:28,534 INFO L225 Difference]: With dead ends: 341 [2020-10-21 23:03:28,534 INFO L226 Difference]: Without dead ends: 337 [2020-10-21 23:03:28,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:03:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2020-10-21 23:03:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 253. [2020-10-21 23:03:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-10-21 23:03:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 561 transitions. [2020-10-21 23:03:28,543 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 561 transitions. Word has length 17 [2020-10-21 23:03:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:28,543 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 561 transitions. [2020-10-21 23:03:28,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:03:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 561 transitions. [2020-10-21 23:03:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:03:28,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:28,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:28,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:03:28,545 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1549968451, now seen corresponding path program 4 times [2020-10-21 23:03:28,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:28,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093292826] [2020-10-21 23:03:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:28,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093292826] [2020-10-21 23:03:28,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:28,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:03:28,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759441543] [2020-10-21 23:03:28,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:03:28,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:03:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:03:28,955 INFO L87 Difference]: Start difference. First operand 253 states and 561 transitions. Second operand 11 states. [2020-10-21 23:03:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:29,567 INFO L93 Difference]: Finished difference Result 358 states and 785 transitions. [2020-10-21 23:03:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-21 23:03:29,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-10-21 23:03:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:29,570 INFO L225 Difference]: With dead ends: 358 [2020-10-21 23:03:29,570 INFO L226 Difference]: Without dead ends: 329 [2020-10-21 23:03:29,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:03:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-10-21 23:03:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 263. [2020-10-21 23:03:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-10-21 23:03:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 590 transitions. [2020-10-21 23:03:29,581 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 590 transitions. Word has length 17 [2020-10-21 23:03:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:29,583 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 590 transitions. [2020-10-21 23:03:29,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:03:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 590 transitions. [2020-10-21 23:03:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:03:29,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:29,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:29,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:03:29,585 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1193190544, now seen corresponding path program 1 times [2020-10-21 23:03:29,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:29,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726357140] [2020-10-21 23:03:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:29,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726357140] [2020-10-21 23:03:29,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:29,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:03:29,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057651246] [2020-10-21 23:03:29,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:03:29,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:03:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:03:29,684 INFO L87 Difference]: Start difference. First operand 263 states and 590 transitions. Second operand 6 states. [2020-10-21 23:03:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:29,734 INFO L93 Difference]: Finished difference Result 238 states and 538 transitions. [2020-10-21 23:03:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:03:29,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:03:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:29,736 INFO L225 Difference]: With dead ends: 238 [2020-10-21 23:03:29,736 INFO L226 Difference]: Without dead ends: 205 [2020-10-21 23:03:29,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:03:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-21 23:03:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 197. [2020-10-21 23:03:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-10-21 23:03:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 451 transitions. [2020-10-21 23:03:29,744 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 451 transitions. Word has length 18 [2020-10-21 23:03:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:29,745 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 451 transitions. [2020-10-21 23:03:29,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:03:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 451 transitions. [2020-10-21 23:03:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:03:29,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:29,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:29,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:03:29,746 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:29,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1229086915, now seen corresponding path program 1 times [2020-10-21 23:03:29,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:29,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762189251] [2020-10-21 23:03:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:03:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:03:29,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762189251] [2020-10-21 23:03:29,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:03:29,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:03:29,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026918666] [2020-10-21 23:03:29,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:03:29,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:03:29,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:03:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:03:29,860 INFO L87 Difference]: Start difference. First operand 197 states and 451 transitions. Second operand 6 states. [2020-10-21 23:03:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:03:29,979 INFO L93 Difference]: Finished difference Result 224 states and 500 transitions. [2020-10-21 23:03:29,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:03:29,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 23:03:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:03:29,981 INFO L225 Difference]: With dead ends: 224 [2020-10-21 23:03:29,981 INFO L226 Difference]: Without dead ends: 188 [2020-10-21 23:03:29,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:03:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-10-21 23:03:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-10-21 23:03:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-21 23:03:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 420 transitions. [2020-10-21 23:03:29,988 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 420 transitions. Word has length 20 [2020-10-21 23:03:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:03:29,988 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 420 transitions. [2020-10-21 23:03:29,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:03:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 420 transitions. [2020-10-21 23:03:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:03:29,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:03:29,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:03:29,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:03:29,994 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:03:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:03:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1992527071, now seen corresponding path program 2 times [2020-10-21 23:03:29,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:03:29,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754741204] [2020-10-21 23:03:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:03:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:03:30,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:03:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:03:30,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:03:30,248 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:03:30,248 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:03:30,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:03:30,282 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,283 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,283 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,283 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,284 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,298 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,303 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,303 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,304 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,304 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,305 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,306 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,306 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,307 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,307 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,308 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:03:30,308 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:03:30,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:03:30 BasicIcfg [2020-10-21 23:03:30,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:03:30,401 INFO L168 Benchmark]: Toolchain (without parser) took 18946.53 ms. Allocated memory was 138.4 MB in the beginning and 475.5 MB in the end (delta: 337.1 MB). Free memory was 99.9 MB in the beginning and 395.1 MB in the end (delta: -295.2 MB). Peak memory consumption was 360.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,401 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.46 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.0 MB in the beginning and 150.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.82 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,405 INFO L168 Benchmark]: Boogie Preprocessor took 75.00 ms. Allocated memory is still 200.8 MB. Free memory was 147.4 MB in the beginning and 144.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,406 INFO L168 Benchmark]: RCFGBuilder took 2820.88 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 144.5 MB in the beginning and 208.5 MB in the end (delta: -64.0 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,407 INFO L168 Benchmark]: TraceAbstraction took 15197.55 ms. Allocated memory was 251.1 MB in the beginning and 475.5 MB in the end (delta: 224.4 MB). Free memory was 208.5 MB in the beginning and 395.1 MB in the end (delta: -186.6 MB). Peak memory consumption was 356.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:03:30,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.46 ms. Allocated memory was 138.4 MB in the beginning and 200.8 MB in the end (delta: 62.4 MB). Free memory was 99.0 MB in the beginning and 150.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.82 ms. Allocated memory is still 200.8 MB. Free memory was 150.2 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.00 ms. Allocated memory is still 200.8 MB. Free memory was 147.4 MB in the beginning and 144.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2820.88 ms. Allocated memory was 200.8 MB in the beginning and 251.1 MB in the end (delta: 50.3 MB). Free memory was 144.5 MB in the beginning and 208.5 MB in the end (delta: -64.0 MB). Peak memory consumption was 112.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15197.55 ms. Allocated memory was 251.1 MB in the beginning and 475.5 MB in the end (delta: 224.4 MB). Free memory was 208.5 MB in the beginning and 395.1 MB in the end (delta: -186.6 MB). Peak memory consumption was 356.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 774 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 124 PlacesBefore, 35 PlacesAfterwards, 117 TransitionsBefore, 26 TransitionsAfterwards, 1570 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 4048 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1696; [L848] FCALL, FORK 0 pthread_create(&t1696, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L766] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L766] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L767] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L767] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L768] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L769] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L771] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t1697; [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L850] FCALL, FORK 0 pthread_create(&t1697, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L851] 0 pthread_t t1698; [L791] 2 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L852] FCALL, FORK 0 pthread_create(&t1698, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L802] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L804] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L805] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L807] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L822] 3 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi006_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=255, weak$$choice2=0, x={7:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 383 SDtfs, 440 SDslu, 1154 SDs, 0 SdLazy, 1387 SolverSat, 197 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 660 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 56194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...