/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:07:40,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:07:40,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:07:40,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:07:40,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:07:40,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:07:40,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:07:40,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:07:40,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:07:40,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:07:41,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:07:41,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:07:41,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:07:41,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:07:41,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:07:41,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:07:41,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:07:41,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:07:41,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:07:41,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:07:41,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:07:41,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:07:41,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:07:41,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:07:41,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:07:41,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:07:41,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:07:41,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:07:41,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:07:41,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:07:41,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:07:41,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:07:41,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:07:41,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:07:41,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:07:41,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:07:41,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:07:41,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:07:41,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:07:41,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:07:41,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:07:41,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:07:41,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:07:41,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:07:41,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:07:41,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:07:41,078 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:07:41,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:07:41,079 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:07:41,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:07:41,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:07:41,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:07:41,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:07:41,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:07:41,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:07:41,082 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:07:41,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:07:41,082 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:07:41,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:07:41,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:07:41,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:07:41,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:07:41,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:07:41,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:07:41,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:07:41,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:07:41,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:07:41,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:07:41,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:07:41,085 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:07:41,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:07:41,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:07:41,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:07:41,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:07:41,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:07:41,402 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:07:41,402 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:07:41,403 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-18 21:07:41,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5ae729d/0226e7da82d24b2dbe4d27aea13a05d2/FLAGfefc4b0cf [2019-12-18 21:07:42,064 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:07:42,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.oepc.i [2019-12-18 21:07:42,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5ae729d/0226e7da82d24b2dbe4d27aea13a05d2/FLAGfefc4b0cf [2019-12-18 21:07:42,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c5ae729d/0226e7da82d24b2dbe4d27aea13a05d2 [2019-12-18 21:07:42,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:07:42,333 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:07:42,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:07:42,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:07:42,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:07:42,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:07:42" (1/1) ... [2019-12-18 21:07:42,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4f6ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:42, skipping insertion in model container [2019-12-18 21:07:42,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:07:42" (1/1) ... [2019-12-18 21:07:42,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:07:42,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:07:42,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:07:42,984 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:07:43,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:07:43,147 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:07:43,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43 WrapperNode [2019-12-18 21:07:43,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:07:43,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:07:43,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:07:43,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:07:43,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:07:43,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:07:43,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:07:43,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:07:43,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... [2019-12-18 21:07:43,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:07:43,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:07:43,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:07:43,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:07:43,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:07:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:07:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:07:43,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:07:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:07:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:07:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:07:43,313 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:07:43,313 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:07:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:07:43,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:07:43,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:07:43,318 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:07:44,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:07:44,037 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:07:44,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:07:44 BoogieIcfgContainer [2019-12-18 21:07:44,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:07:44,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:07:44,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:07:44,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:07:44,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:07:42" (1/3) ... [2019-12-18 21:07:44,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:07:44, skipping insertion in model container [2019-12-18 21:07:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:07:43" (2/3) ... [2019-12-18 21:07:44,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:07:44, skipping insertion in model container [2019-12-18 21:07:44,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:07:44" (3/3) ... [2019-12-18 21:07:44,049 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.oepc.i [2019-12-18 21:07:44,060 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:07:44,061 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:07:44,069 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:07:44,071 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:07:44,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,113 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,114 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:07:44,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:07:44,216 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:07:44,217 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:07:44,217 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:07:44,217 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:07:44,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:07:44,217 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:07:44,218 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:07:44,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:07:44,235 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-18 21:07:44,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 21:07:44,312 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 21:07:44,313 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:07:44,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:07:44,347 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-18 21:07:44,396 INFO L126 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-18 21:07:44,396 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:07:44,407 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:07:44,431 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:07:44,432 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:07:46,783 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-18 21:07:47,188 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-18 21:07:47,891 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 21:07:48,009 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 21:07:48,211 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:07:48,334 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:07:48,358 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-18 21:07:48,358 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:07:48,362 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-18 21:07:48,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-18 21:07:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-18 21:07:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:07:48,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:48,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:07:48,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-18 21:07:48,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:48,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906784547] [2019-12-18 21:07:48,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:49,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906784547] [2019-12-18 21:07:49,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:49,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:07:49,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623315539] [2019-12-18 21:07:49,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:49,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:49,148 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-18 21:07:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:49,467 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-18 21:07:49,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:49,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:07:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:49,568 INFO L225 Difference]: With dead ends: 8682 [2019-12-18 21:07:49,568 INFO L226 Difference]: Without dead ends: 8178 [2019-12-18 21:07:49,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-18 21:07:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-18 21:07:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-18 21:07:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-18 21:07:50,150 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-18 21:07:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:50,150 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-18 21:07:50,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-18 21:07:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:07:50,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:50,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:50,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-18 21:07:50,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:50,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670777231] [2019-12-18 21:07:50,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:50,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670777231] [2019-12-18 21:07:50,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:50,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:50,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807396176] [2019-12-18 21:07:50,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:50,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:50,238 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-18 21:07:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:50,279 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-18 21:07:50,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:50,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 21:07:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:50,288 INFO L225 Difference]: With dead ends: 1311 [2019-12-18 21:07:50,288 INFO L226 Difference]: Without dead ends: 1311 [2019-12-18 21:07:50,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-18 21:07:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-18 21:07:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-18 21:07:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-18 21:07:50,336 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-18 21:07:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:50,336 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-18 21:07:50,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-18 21:07:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:07:50,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:50,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:50,344 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-18 21:07:50,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:50,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390860046] [2019-12-18 21:07:50,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:50,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390860046] [2019-12-18 21:07:50,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:50,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:50,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444797882] [2019-12-18 21:07:50,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:50,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:50,484 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-18 21:07:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:50,575 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-18 21:07:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:50,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 21:07:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:50,587 INFO L225 Difference]: With dead ends: 2020 [2019-12-18 21:07:50,587 INFO L226 Difference]: Without dead ends: 2020 [2019-12-18 21:07:50,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-18 21:07:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-18 21:07:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-18 21:07:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-18 21:07:50,639 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-18 21:07:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:50,640 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-18 21:07:50,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-18 21:07:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:07:50,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:50,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:50,643 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:50,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-18 21:07:50,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:50,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992013037] [2019-12-18 21:07:50,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:50,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992013037] [2019-12-18 21:07:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:50,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796413871] [2019-12-18 21:07:50,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:50,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:50,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:50,785 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-18 21:07:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:51,002 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-18 21:07:51,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:51,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:07:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:51,014 INFO L225 Difference]: With dead ends: 1830 [2019-12-18 21:07:51,014 INFO L226 Difference]: Without dead ends: 1830 [2019-12-18 21:07:51,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-18 21:07:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-18 21:07:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-18 21:07:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-18 21:07:51,064 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-18 21:07:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:51,064 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-18 21:07:51,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-18 21:07:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:07:51,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:51,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:51,066 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-18 21:07:51,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:51,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809351157] [2019-12-18 21:07:51,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:51,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809351157] [2019-12-18 21:07:51,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:51,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:51,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644660045] [2019-12-18 21:07:51,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:51,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:51,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:51,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:51,147 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-18 21:07:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:51,345 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-18 21:07:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:51,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:07:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:51,357 INFO L225 Difference]: With dead ends: 2141 [2019-12-18 21:07:51,357 INFO L226 Difference]: Without dead ends: 2141 [2019-12-18 21:07:51,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-18 21:07:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-18 21:07:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-18 21:07:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-18 21:07:51,475 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-18 21:07:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:51,476 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-18 21:07:51,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-18 21:07:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:07:51,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:51,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:51,479 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:51,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-18 21:07:51,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:51,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227916278] [2019-12-18 21:07:51,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:51,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227916278] [2019-12-18 21:07:51,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:51,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:51,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106068888] [2019-12-18 21:07:51,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:51,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:51,576 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-18 21:07:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:51,852 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-18 21:07:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:07:51,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 21:07:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:51,864 INFO L225 Difference]: With dead ends: 2408 [2019-12-18 21:07:51,864 INFO L226 Difference]: Without dead ends: 2408 [2019-12-18 21:07:51,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:07:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-18 21:07:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-18 21:07:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-18 21:07:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-18 21:07:51,915 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-18 21:07:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:51,915 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-18 21:07:51,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-18 21:07:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:07:51,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:51,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:51,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-18 21:07:51,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:51,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442140485] [2019-12-18 21:07:51,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:51,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442140485] [2019-12-18 21:07:51,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:51,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:07:51,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369282610] [2019-12-18 21:07:51,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:51,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:51,971 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 3 states. [2019-12-18 21:07:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:51,984 INFO L93 Difference]: Finished difference Result 2151 states and 4904 transitions. [2019-12-18 21:07:51,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:51,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 21:07:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:52,000 INFO L225 Difference]: With dead ends: 2151 [2019-12-18 21:07:52,000 INFO L226 Difference]: Without dead ends: 2151 [2019-12-18 21:07:52,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-12-18 21:07:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2151. [2019-12-18 21:07:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-12-18 21:07:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 4904 transitions. [2019-12-18 21:07:52,050 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 4904 transitions. Word has length 26 [2019-12-18 21:07:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:52,051 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 4904 transitions. [2019-12-18 21:07:52,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 4904 transitions. [2019-12-18 21:07:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:07:52,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:52,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:52,054 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-18 21:07:52,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:52,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370094089] [2019-12-18 21:07:52,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:52,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370094089] [2019-12-18 21:07:52,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:52,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:52,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236099143] [2019-12-18 21:07:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:52,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:52,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:52,129 INFO L87 Difference]: Start difference. First operand 2151 states and 4904 transitions. Second operand 5 states. [2019-12-18 21:07:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:52,364 INFO L93 Difference]: Finished difference Result 2528 states and 5638 transitions. [2019-12-18 21:07:52,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:07:52,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:07:52,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:52,372 INFO L225 Difference]: With dead ends: 2528 [2019-12-18 21:07:52,372 INFO L226 Difference]: Without dead ends: 2528 [2019-12-18 21:07:52,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:07:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2019-12-18 21:07:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2001. [2019-12-18 21:07:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-12-18 21:07:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4588 transitions. [2019-12-18 21:07:52,418 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4588 transitions. Word has length 26 [2019-12-18 21:07:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:52,419 INFO L462 AbstractCegarLoop]: Abstraction has 2001 states and 4588 transitions. [2019-12-18 21:07:52,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4588 transitions. [2019-12-18 21:07:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:07:52,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:52,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:52,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 211358289, now seen corresponding path program 1 times [2019-12-18 21:07:52,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500245826] [2019-12-18 21:07:52,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:52,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500245826] [2019-12-18 21:07:52,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:52,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:52,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266077565] [2019-12-18 21:07:52,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:52,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:52,478 INFO L87 Difference]: Start difference. First operand 2001 states and 4588 transitions. Second operand 4 states. [2019-12-18 21:07:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:52,505 INFO L93 Difference]: Finished difference Result 3197 states and 7449 transitions. [2019-12-18 21:07:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:52,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 21:07:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:52,510 INFO L225 Difference]: With dead ends: 3197 [2019-12-18 21:07:52,511 INFO L226 Difference]: Without dead ends: 1474 [2019-12-18 21:07:52,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-12-18 21:07:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1458. [2019-12-18 21:07:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-12-18 21:07:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 3355 transitions. [2019-12-18 21:07:52,542 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 3355 transitions. Word has length 27 [2019-12-18 21:07:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:52,543 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 3355 transitions. [2019-12-18 21:07:52,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 3355 transitions. [2019-12-18 21:07:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:07:52,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:52,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:52,546 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash 204269275, now seen corresponding path program 2 times [2019-12-18 21:07:52,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:52,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815966022] [2019-12-18 21:07:52,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:52,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815966022] [2019-12-18 21:07:52,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:52,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:07:52,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758584489] [2019-12-18 21:07:52,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:52,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:52,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:52,688 INFO L87 Difference]: Start difference. First operand 1458 states and 3355 transitions. Second operand 5 states. [2019-12-18 21:07:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:53,189 INFO L93 Difference]: Finished difference Result 2302 states and 5154 transitions. [2019-12-18 21:07:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:07:53,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:07:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:53,194 INFO L225 Difference]: With dead ends: 2302 [2019-12-18 21:07:53,195 INFO L226 Difference]: Without dead ends: 2302 [2019-12-18 21:07:53,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-12-18 21:07:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2100. [2019-12-18 21:07:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-18 21:07:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4761 transitions. [2019-12-18 21:07:53,238 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4761 transitions. Word has length 27 [2019-12-18 21:07:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:53,240 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4761 transitions. [2019-12-18 21:07:53,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4761 transitions. [2019-12-18 21:07:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:07:53,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:53,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:53,244 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 545456611, now seen corresponding path program 1 times [2019-12-18 21:07:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:53,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997638511] [2019-12-18 21:07:53,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:53,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997638511] [2019-12-18 21:07:53,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:53,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:53,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345379457] [2019-12-18 21:07:53,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:53,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:53,289 INFO L87 Difference]: Start difference. First operand 2100 states and 4761 transitions. Second operand 4 states. [2019-12-18 21:07:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:53,307 INFO L93 Difference]: Finished difference Result 1134 states and 2437 transitions. [2019-12-18 21:07:53,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:53,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 21:07:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:53,310 INFO L225 Difference]: With dead ends: 1134 [2019-12-18 21:07:53,310 INFO L226 Difference]: Without dead ends: 1022 [2019-12-18 21:07:53,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-12-18 21:07:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2019-12-18 21:07:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-18 21:07:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2183 transitions. [2019-12-18 21:07:53,329 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2183 transitions. Word has length 28 [2019-12-18 21:07:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:53,330 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2183 transitions. [2019-12-18 21:07:53,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2183 transitions. [2019-12-18 21:07:53,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:07:53,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:53,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:53,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1584554722, now seen corresponding path program 1 times [2019-12-18 21:07:53,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:53,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672474468] [2019-12-18 21:07:53,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:53,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672474468] [2019-12-18 21:07:53,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:53,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:07:53,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725804027] [2019-12-18 21:07:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:07:53,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:07:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:07:53,441 INFO L87 Difference]: Start difference. First operand 980 states and 2183 transitions. Second operand 7 states. [2019-12-18 21:07:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:53,717 INFO L93 Difference]: Finished difference Result 2849 states and 5974 transitions. [2019-12-18 21:07:53,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:07:53,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:07:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:53,722 INFO L225 Difference]: With dead ends: 2849 [2019-12-18 21:07:53,722 INFO L226 Difference]: Without dead ends: 1894 [2019-12-18 21:07:53,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:07:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-12-18 21:07:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1021. [2019-12-18 21:07:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2019-12-18 21:07:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 2247 transitions. [2019-12-18 21:07:53,749 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 2247 transitions. Word has length 51 [2019-12-18 21:07:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:53,750 INFO L462 AbstractCegarLoop]: Abstraction has 1021 states and 2247 transitions. [2019-12-18 21:07:53,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:07:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 2247 transitions. [2019-12-18 21:07:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:07:53,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:53,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:53,753 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 2 times [2019-12-18 21:07:53,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:53,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072749627] [2019-12-18 21:07:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:53,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072749627] [2019-12-18 21:07:53,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:53,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:53,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664474631] [2019-12-18 21:07:53,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:53,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:53,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:53,813 INFO L87 Difference]: Start difference. First operand 1021 states and 2247 transitions. Second operand 3 states. [2019-12-18 21:07:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:53,959 INFO L93 Difference]: Finished difference Result 1257 states and 2726 transitions. [2019-12-18 21:07:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:53,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:07:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:53,962 INFO L225 Difference]: With dead ends: 1257 [2019-12-18 21:07:53,962 INFO L226 Difference]: Without dead ends: 1257 [2019-12-18 21:07:53,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-18 21:07:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1055. [2019-12-18 21:07:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-18 21:07:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2325 transitions. [2019-12-18 21:07:53,984 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2325 transitions. Word has length 51 [2019-12-18 21:07:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:53,984 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2325 transitions. [2019-12-18 21:07:53,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2325 transitions. [2019-12-18 21:07:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:53,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:53,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:53,987 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1959690206, now seen corresponding path program 1 times [2019-12-18 21:07:53,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:53,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477660505] [2019-12-18 21:07:53,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:54,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477660505] [2019-12-18 21:07:54,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:54,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:54,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96938644] [2019-12-18 21:07:54,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:54,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:54,035 INFO L87 Difference]: Start difference. First operand 1055 states and 2325 transitions. Second operand 4 states. [2019-12-18 21:07:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:54,253 INFO L93 Difference]: Finished difference Result 1677 states and 3668 transitions. [2019-12-18 21:07:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:54,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:07:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:54,257 INFO L225 Difference]: With dead ends: 1677 [2019-12-18 21:07:54,258 INFO L226 Difference]: Without dead ends: 1677 [2019-12-18 21:07:54,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-12-18 21:07:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1120. [2019-12-18 21:07:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-12-18 21:07:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2482 transitions. [2019-12-18 21:07:54,284 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2482 transitions. Word has length 52 [2019-12-18 21:07:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:54,284 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 2482 transitions. [2019-12-18 21:07:54,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2482 transitions. [2019-12-18 21:07:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:54,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:54,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:54,288 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1282647992, now seen corresponding path program 2 times [2019-12-18 21:07:54,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:54,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153095770] [2019-12-18 21:07:54,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:54,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153095770] [2019-12-18 21:07:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:54,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:54,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837083089] [2019-12-18 21:07:54,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:54,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:54,340 INFO L87 Difference]: Start difference. First operand 1120 states and 2482 transitions. Second operand 4 states. [2019-12-18 21:07:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:54,457 INFO L93 Difference]: Finished difference Result 1455 states and 3174 transitions. [2019-12-18 21:07:54,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:54,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:07:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:54,461 INFO L225 Difference]: With dead ends: 1455 [2019-12-18 21:07:54,461 INFO L226 Difference]: Without dead ends: 1455 [2019-12-18 21:07:54,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-12-18 21:07:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1101. [2019-12-18 21:07:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-12-18 21:07:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 2444 transitions. [2019-12-18 21:07:54,482 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 2444 transitions. Word has length 52 [2019-12-18 21:07:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:54,483 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 2444 transitions. [2019-12-18 21:07:54,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 2444 transitions. [2019-12-18 21:07:54,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:54,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:54,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:54,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:54,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1122069892, now seen corresponding path program 3 times [2019-12-18 21:07:54,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:54,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017581248] [2019-12-18 21:07:54,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:54,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017581248] [2019-12-18 21:07:54,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:54,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:07:54,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778672173] [2019-12-18 21:07:54,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:07:54,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:54,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:07:54,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:07:54,560 INFO L87 Difference]: Start difference. First operand 1101 states and 2444 transitions. Second operand 7 states. [2019-12-18 21:07:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:54,822 INFO L93 Difference]: Finished difference Result 2643 states and 5571 transitions. [2019-12-18 21:07:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:07:54,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:07:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:54,827 INFO L225 Difference]: With dead ends: 2643 [2019-12-18 21:07:54,827 INFO L226 Difference]: Without dead ends: 2199 [2019-12-18 21:07:54,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:07:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-12-18 21:07:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 1102. [2019-12-18 21:07:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 21:07:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2448 transitions. [2019-12-18 21:07:54,854 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2448 transitions. Word has length 52 [2019-12-18 21:07:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:54,855 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2448 transitions. [2019-12-18 21:07:54,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:07:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2448 transitions. [2019-12-18 21:07:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:54,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:54,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:54,858 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1309400956, now seen corresponding path program 4 times [2019-12-18 21:07:54,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:54,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212305449] [2019-12-18 21:07:54,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:54,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212305449] [2019-12-18 21:07:54,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:54,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:07:54,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861624434] [2019-12-18 21:07:54,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:07:54,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:54,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:07:54,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:54,969 INFO L87 Difference]: Start difference. First operand 1102 states and 2448 transitions. Second operand 6 states. [2019-12-18 21:07:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:55,199 INFO L93 Difference]: Finished difference Result 1683 states and 3688 transitions. [2019-12-18 21:07:55,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:07:55,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:07:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:55,203 INFO L225 Difference]: With dead ends: 1683 [2019-12-18 21:07:55,203 INFO L226 Difference]: Without dead ends: 1683 [2019-12-18 21:07:55,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:07:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-12-18 21:07:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1092. [2019-12-18 21:07:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-12-18 21:07:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2416 transitions. [2019-12-18 21:07:55,229 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2416 transitions. Word has length 52 [2019-12-18 21:07:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:55,230 INFO L462 AbstractCegarLoop]: Abstraction has 1092 states and 2416 transitions. [2019-12-18 21:07:55,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:07:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2416 transitions. [2019-12-18 21:07:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:55,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:55,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:55,233 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1371884580, now seen corresponding path program 1 times [2019-12-18 21:07:55,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:55,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993620967] [2019-12-18 21:07:55,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:55,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993620967] [2019-12-18 21:07:55,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:55,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:55,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445135379] [2019-12-18 21:07:55,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:55,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:55,276 INFO L87 Difference]: Start difference. First operand 1092 states and 2416 transitions. Second operand 3 states. [2019-12-18 21:07:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:55,319 INFO L93 Difference]: Finished difference Result 1303 states and 2650 transitions. [2019-12-18 21:07:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:55,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:07:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:55,321 INFO L225 Difference]: With dead ends: 1303 [2019-12-18 21:07:55,321 INFO L226 Difference]: Without dead ends: 1303 [2019-12-18 21:07:55,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2019-12-18 21:07:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1003. [2019-12-18 21:07:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2019-12-18 21:07:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 2083 transitions. [2019-12-18 21:07:55,404 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 2083 transitions. Word has length 52 [2019-12-18 21:07:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:55,404 INFO L462 AbstractCegarLoop]: Abstraction has 1003 states and 2083 transitions. [2019-12-18 21:07:55,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 2083 transitions. [2019-12-18 21:07:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:07:55,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:55,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:55,407 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1747792130, now seen corresponding path program 1 times [2019-12-18 21:07:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807802503] [2019-12-18 21:07:55,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:07:55,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807802503] [2019-12-18 21:07:55,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:55,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:55,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135747374] [2019-12-18 21:07:55,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:55,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:55,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:55,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:55,518 INFO L87 Difference]: Start difference. First operand 1003 states and 2083 transitions. Second operand 3 states. [2019-12-18 21:07:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:55,535 INFO L93 Difference]: Finished difference Result 1002 states and 2081 transitions. [2019-12-18 21:07:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:55,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:07:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:55,537 INFO L225 Difference]: With dead ends: 1002 [2019-12-18 21:07:55,537 INFO L226 Difference]: Without dead ends: 1002 [2019-12-18 21:07:55,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-12-18 21:07:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 893. [2019-12-18 21:07:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-12-18 21:07:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1882 transitions. [2019-12-18 21:07:55,551 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1882 transitions. Word has length 52 [2019-12-18 21:07:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:55,552 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1882 transitions. [2019-12-18 21:07:55,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1882 transitions. [2019-12-18 21:07:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:07:55,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:55,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:55,554 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:55,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:55,554 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-18 21:07:55,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:55,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445247745] [2019-12-18 21:07:55,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:07:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:07:55,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:07:55,692 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:07:55,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t833~0.base_25| 4) |v_#length_19|) (= 0 v_~weak$$choice0~0_9) (= |v_ULTIMATE.start_main_~#t833~0.offset_19| 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff1_thd2~0_49) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t833~0.base_25| 1)) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t833~0.base_25|) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t833~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t833~0.base_25|) |v_ULTIMATE.start_main_~#t833~0.offset_19| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t833~0.base_25|) 0) (= 0 |v_#NULL.base_2|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_21|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ULTIMATE.start_main_~#t833~0.offset=|v_ULTIMATE.start_main_~#t833~0.offset_19|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_16|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t833~0.base=|v_ULTIMATE.start_main_~#t833~0.base_25|} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t834~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t833~0.offset, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t834~0.offset, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t833~0.base] because there is no mapped edge [2019-12-18 21:07:55,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~a$w_buff1_used~0_Out-1932489362 ~a$w_buff0_used~0_In-1932489362) (= |P0Thread1of1ForFork0_#in~arg.base_In-1932489362| P0Thread1of1ForFork0_~arg.base_Out-1932489362) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1932489362| 1) (= 1 ~a$w_buff0~0_Out-1932489362) (= ~a$w_buff1~0_Out-1932489362 ~a$w_buff0~0_In-1932489362) (= 0 (mod ~a$w_buff1_used~0_Out-1932489362 256)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1932489362| P0Thread1of1ForFork0_~arg.offset_Out-1932489362) (= ~a$w_buff0_used~0_Out-1932489362 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1932489362| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1932489362)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1932489362|, ~a$w_buff0~0=~a$w_buff0~0_In-1932489362, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1932489362|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1932489362} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1932489362|, ~a$w_buff1~0=~a$w_buff1~0_Out-1932489362, ~a$w_buff0~0=~a$w_buff0~0_Out-1932489362, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1932489362, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1932489362|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1932489362, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1932489362, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1932489362, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1932489362|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1932489362} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:07:55,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t834~0.base_10| 0)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t834~0.base_10|) |v_ULTIMATE.start_main_~#t834~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t834~0.offset_9| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t834~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t834~0.base_10|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t834~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t834~0.base=|v_ULTIMATE.start_main_~#t834~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t834~0.offset=|v_ULTIMATE.start_main_~#t834~0.offset_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t834~0.base, ULTIMATE.start_main_~#t834~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:07:55,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-786171571 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-786171571| |P1Thread1of1ForFork1_#t~ite23_Out-786171571|) (= |P1Thread1of1ForFork1_#t~ite24_Out-786171571| ~a$w_buff1_used~0_In-786171571)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-786171571| |P1Thread1of1ForFork1_#t~ite23_Out-786171571|) (= ~a$w_buff1_used~0_In-786171571 |P1Thread1of1ForFork1_#t~ite23_Out-786171571|) (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-786171571 256) 0))) (or (= (mod ~a$w_buff0_used~0_In-786171571 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-786171571 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-786171571 256))))) .cse0))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-786171571, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-786171571, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-786171571|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-786171571, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-786171571, ~weak$$choice2~0=~weak$$choice2~0_In-786171571} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-786171571, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-786171571|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-786171571, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-786171571|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-786171571, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-786171571, ~weak$$choice2~0=~weak$$choice2~0_In-786171571} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-18 21:07:55,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:07:55,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In215904123 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In215904123 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In215904123 |P0Thread1of1ForFork0_#t~ite5_Out215904123|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out215904123| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In215904123, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In215904123} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out215904123|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In215904123, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In215904123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:07:55,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd1~0_In450901119 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In450901119 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In450901119 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In450901119 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out450901119| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out450901119| ~a$w_buff1_used~0_In450901119) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In450901119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In450901119, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In450901119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In450901119} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out450901119|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In450901119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In450901119, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In450901119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In450901119} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:07:55,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In1216693928 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1216693928 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out1216693928 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out1216693928 ~a$r_buff0_thd1~0_In1216693928)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1216693928, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1216693928} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1216693928|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1216693928, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1216693928} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:07:55,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-988634612 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-988634612 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-988634612 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-988634612 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-988634612|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd1~0_In-988634612 |P0Thread1of1ForFork0_#t~ite8_Out-988634612|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-988634612, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-988634612, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-988634612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988634612} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-988634612, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-988634612|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-988634612, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-988634612, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-988634612} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:07:55,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:07:55,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:07:55,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In839502275 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In839502275 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out839502275| |P1Thread1of1ForFork1_#t~ite32_Out839502275|))) (or (and (or .cse0 .cse1) (= ~a~0_In839502275 |P1Thread1of1ForFork1_#t~ite32_Out839502275|) .cse2) (and (not .cse1) (= ~a$w_buff1~0_In839502275 |P1Thread1of1ForFork1_#t~ite32_Out839502275|) (not .cse0) .cse2))) InVars {~a~0=~a~0_In839502275, ~a$w_buff1~0=~a$w_buff1~0_In839502275, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In839502275, ~a$w_buff1_used~0=~a$w_buff1_used~0_In839502275} OutVars{~a~0=~a~0_In839502275, ~a$w_buff1~0=~a$w_buff1~0_In839502275, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In839502275, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out839502275|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out839502275|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In839502275} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 21:07:55,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-401628096 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-401628096 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-401628096| ~a$w_buff0_used~0_In-401628096) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-401628096| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-401628096, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401628096} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-401628096|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-401628096, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-401628096} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:07:55,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-958671528 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-958671528 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-958671528 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-958671528 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-958671528|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-958671528 |P1Thread1of1ForFork1_#t~ite35_Out-958671528|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-958671528, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958671528, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958671528, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958671528} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-958671528, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-958671528, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-958671528, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-958671528|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958671528} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:07:55,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1131306432 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1131306432 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1131306432|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1131306432 |P1Thread1of1ForFork1_#t~ite36_Out-1131306432|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1131306432, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1131306432} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1131306432, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1131306432, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1131306432|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:07:55,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-8815494 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-8815494 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-8815494 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-8815494 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-8815494|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-8815494| ~a$r_buff1_thd2~0_In-8815494) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-8815494, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-8815494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8815494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8815494} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-8815494, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-8815494, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8815494, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8815494, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-8815494|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:07:55,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:07:55,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:07:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1918686232 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1918686232 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-1918686232 |ULTIMATE.start_main_#t~ite40_Out-1918686232|) (not .cse1)) (and (= ~a~0_In-1918686232 |ULTIMATE.start_main_#t~ite40_Out-1918686232|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In-1918686232, ~a$w_buff1~0=~a$w_buff1~0_In-1918686232, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1918686232, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1918686232} OutVars{~a~0=~a~0_In-1918686232, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1918686232|, ~a$w_buff1~0=~a$w_buff1~0_In-1918686232, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1918686232, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1918686232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:07:55,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:07:55,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1644113804 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1644113804 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1644113804| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1644113804| ~a$w_buff0_used~0_In-1644113804)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1644113804, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1644113804} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1644113804, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1644113804, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1644113804|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:07:55,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1199732328 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1199732328 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1199732328 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1199732328 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1199732328| ~a$w_buff1_used~0_In1199732328) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out1199732328| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1199732328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1199732328, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1199732328, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1199732328} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1199732328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1199732328, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1199732328, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1199732328, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1199732328|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:07:55,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-942869379 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-942869379 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-942869379| ~a$r_buff0_thd0~0_In-942869379) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-942869379| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-942869379, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-942869379} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-942869379, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-942869379, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-942869379|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:07:55,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-74212947 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-74212947 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-74212947 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-74212947 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-74212947|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$r_buff1_thd0~0_In-74212947 |ULTIMATE.start_main_#t~ite45_Out-74212947|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-74212947, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-74212947, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-74212947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-74212947} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-74212947, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-74212947, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-74212947, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-74212947, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-74212947|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:07:55,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:07:55,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:07:55 BasicIcfg [2019-12-18 21:07:55,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:07:55,823 INFO L168 Benchmark]: Toolchain (without parser) took 13490.61 ms. Allocated memory was 141.6 MB in the beginning and 427.8 MB in the end (delta: 286.3 MB). Free memory was 104.0 MB in the beginning and 256.8 MB in the end (delta: -152.8 MB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,825 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.38 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.5 MB in the beginning and 159.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.32 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 156.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,826 INFO L168 Benchmark]: Boogie Preprocessor took 42.44 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,827 INFO L168 Benchmark]: RCFGBuilder took 788.28 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 109.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,828 INFO L168 Benchmark]: TraceAbstraction took 11781.04 ms. Allocated memory was 205.0 MB in the beginning and 427.8 MB in the end (delta: 222.8 MB). Free memory was 109.0 MB in the beginning and 256.8 MB in the end (delta: -147.8 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:55,837 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 141.6 MB. Free memory was 123.5 MB in the beginning and 123.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.38 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 103.5 MB in the beginning and 159.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.32 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 156.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.44 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.28 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 109.6 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11781.04 ms. Allocated memory was 205.0 MB in the beginning and 427.8 MB in the end (delta: 222.8 MB). Free memory was 109.0 MB in the beginning and 256.8 MB in the end (delta: -147.8 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t833, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t834, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2313 SDtfs, 2148 SDslu, 4010 SDs, 0 SdLazy, 1927 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred 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: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 5999 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 64163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...