/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:14:30,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:14:30,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:14:30,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:14:30,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:14:30,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:14:30,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:14:30,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:14:30,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:14:30,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:14:30,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:14:30,204 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:14:30,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:14:30,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:14:30,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:14:30,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:14:30,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:14:30,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:14:30,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:14:30,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:14:30,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:14:30,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:14:30,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:14:30,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:14:30,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:14:30,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:14:30,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:14:30,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:14:30,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:14:30,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:14:30,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:14:30,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:14:30,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:14:30,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:14:30,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:14:30,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:14:30,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:14:30,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:14:30,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:14:30,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:14:30,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:14:30,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:14:30,308 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:14:30,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:14:30,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:14:30,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:14:30,311 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:14:30,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:14:30,311 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:14:30,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:14:30,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:14:30,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:14:30,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:14:30,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:14:30,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:14:30,313 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:14:30,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:14:30,313 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:14:30,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:14:30,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:14:30,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:14:30,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:14:30,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:14:30,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:14:30,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:14:30,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:14:30,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:14:30,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:14:30,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:14:30,317 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:14:30,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:14:30,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:14:30,317 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:14:30,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:14:30,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:14:30,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:14:30,868 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:14:30,869 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:14:30,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2020-11-09 15:14:30,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad82ef513/5bcfd649c44c41b0bfd3402dfc54fb43/FLAG2baffffd2 [2020-11-09 15:14:31,806 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:14:31,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2020-11-09 15:14:31,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad82ef513/5bcfd649c44c41b0bfd3402dfc54fb43/FLAG2baffffd2 [2020-11-09 15:14:32,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad82ef513/5bcfd649c44c41b0bfd3402dfc54fb43 [2020-11-09 15:14:32,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:14:32,104 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:14:32,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:14:32,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:14:32,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:14:32,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:14:32" (1/1) ... [2020-11-09 15:14:32,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6799c46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:32, skipping insertion in model container [2020-11-09 15:14:32,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:14:32" (1/1) ... [2020-11-09 15:14:32,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:14:32,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:14:32,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:14:32,946 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:14:33,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:14:33,143 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:14:33,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33 WrapperNode [2020-11-09 15:14:33,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:14:33,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:14:33,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:14:33,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:14:33,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:14:33,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:14:33,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:14:33,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:14:33,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... [2020-11-09 15:14:33,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:14:33,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:14:33,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:14:33,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:14:33,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:14:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:14:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:14:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:14:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:14:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:14:33,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:14:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:14:33,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:14:33,465 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:14:33,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:14:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:14:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:14:33,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:14:33,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:14:33,468 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:14:36,084 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:14:36,084 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:14:36,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:14:36 BoogieIcfgContainer [2020-11-09 15:14:36,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:14:36,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:14:36,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:14:36,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:14:36,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:14:32" (1/3) ... [2020-11-09 15:14:36,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:14:36, skipping insertion in model container [2020-11-09 15:14:36,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:14:33" (2/3) ... [2020-11-09 15:14:36,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a07d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:14:36, skipping insertion in model container [2020-11-09 15:14:36,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:14:36" (3/3) ... [2020-11-09 15:14:36,097 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2020-11-09 15:14:36,116 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:14:36,117 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:14:36,121 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:14:36,122 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:14:36,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,170 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,172 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,183 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,184 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,185 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,223 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:14:36,226 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:14:36,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:14:36,266 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:14:36,267 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:14:36,267 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:14:36,267 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:14:36,267 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:14:36,267 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:14:36,268 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:14:36,268 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:14:36,283 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:14:36,284 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-09 15:14:36,288 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-09 15:14:36,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 231 flow [2020-11-09 15:14:36,347 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-11-09 15:14:36,347 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:14:36,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2020-11-09 15:14:36,356 INFO L116 LiptonReduction]: Number of co-enabled transitions 2178 [2020-11-09 15:14:37,286 WARN L194 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:14:37,438 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 15:14:38,031 WARN L194 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 15:14:38,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:14:38,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:14:38,512 WARN L194 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 15:14:39,434 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 15:14:39,579 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 15:14:39,726 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 15:14:40,681 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:14:40,812 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:14:41,022 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:14:41,230 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 15:14:42,199 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:14:42,350 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:14:43,966 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-11-09 15:14:44,177 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:14:44,331 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:14:44,483 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:14:44,643 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-09 15:14:45,253 WARN L194 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 15:14:45,548 WARN L194 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 15:14:46,189 WARN L194 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 15:14:46,453 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 15:14:46,460 INFO L131 LiptonReduction]: Checked pairs total: 6369 [2020-11-09 15:14:46,460 INFO L133 LiptonReduction]: Total number of compositions: 97 [2020-11-09 15:14:46,467 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-11-09 15:14:46,584 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1136 states. [2020-11-09 15:14:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2020-11-09 15:14:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 15:14:46,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:46,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 15:14:46,597 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1115978, now seen corresponding path program 1 times [2020-11-09 15:14:46,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:46,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086535108] [2020-11-09 15:14:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:46,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086535108] [2020-11-09 15:14:46,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:46,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:14:46,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [458399084] [2020-11-09 15:14:46,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:46,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:46,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 15:14:46,908 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:46,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:46,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:14:46,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:46,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:14:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:46,938 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 3 states. [2020-11-09 15:14:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:47,039 INFO L93 Difference]: Finished difference Result 974 states and 3122 transitions. [2020-11-09 15:14:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:14:47,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 15:14:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:47,074 INFO L225 Difference]: With dead ends: 974 [2020-11-09 15:14:47,075 INFO L226 Difference]: Without dead ends: 794 [2020-11-09 15:14:47,077 INFO L677 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 [2020-11-09 15:14:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-11-09 15:14:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-11-09 15:14:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-11-09 15:14:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2498 transitions. [2020-11-09 15:14:47,203 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2498 transitions. Word has length 3 [2020-11-09 15:14:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:47,204 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 2498 transitions. [2020-11-09 15:14:47,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:14:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2498 transitions. [2020-11-09 15:14:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:14:47,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:47,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:47,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:14:47,207 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2051875512, now seen corresponding path program 1 times [2020-11-09 15:14:47,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:47,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840394250] [2020-11-09 15:14:47,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:47,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840394250] [2020-11-09 15:14:47,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:47,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:14:47,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511018639] [2020-11-09 15:14:47,366 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:47,370 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:47,373 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:14:47,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:47,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:47,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:14:47,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:14:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:47,380 INFO L87 Difference]: Start difference. First operand 794 states and 2498 transitions. Second operand 3 states. [2020-11-09 15:14:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:47,402 INFO L93 Difference]: Finished difference Result 734 states and 2280 transitions. [2020-11-09 15:14:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:14:47,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 15:14:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:47,417 INFO L225 Difference]: With dead ends: 734 [2020-11-09 15:14:47,417 INFO L226 Difference]: Without dead ends: 734 [2020-11-09 15:14:47,418 INFO L677 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 [2020-11-09 15:14:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2020-11-09 15:14:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2020-11-09 15:14:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2020-11-09 15:14:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2280 transitions. [2020-11-09 15:14:47,474 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2280 transitions. Word has length 9 [2020-11-09 15:14:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:47,482 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 2280 transitions. [2020-11-09 15:14:47,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:14:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2280 transitions. [2020-11-09 15:14:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:14:47,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:47,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:47,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:14:47,489 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash -463853272, now seen corresponding path program 1 times [2020-11-09 15:14:47,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:47,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015646298] [2020-11-09 15:14:47,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:47,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015646298] [2020-11-09 15:14:47,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:47,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:14:47,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1414443412] [2020-11-09 15:14:47,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:47,614 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:47,617 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-11-09 15:14:47,617 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:47,696 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:47,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:14:47,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:14:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:47,699 INFO L87 Difference]: Start difference. First operand 734 states and 2280 transitions. Second operand 3 states. [2020-11-09 15:14:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:47,721 INFO L93 Difference]: Finished difference Result 694 states and 2138 transitions. [2020-11-09 15:14:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:14:47,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 15:14:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:47,731 INFO L225 Difference]: With dead ends: 694 [2020-11-09 15:14:47,731 INFO L226 Difference]: Without dead ends: 694 [2020-11-09 15:14:47,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-11-09 15:14:47,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2020-11-09 15:14:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-11-09 15:14:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2138 transitions. [2020-11-09 15:14:47,765 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2138 transitions. Word has length 11 [2020-11-09 15:14:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:47,766 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 2138 transitions. [2020-11-09 15:14:47,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:14:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2138 transitions. [2020-11-09 15:14:47,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:14:47,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:47,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:47,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:14:47,777 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1327759494, now seen corresponding path program 1 times [2020-11-09 15:14:47,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:47,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525612766] [2020-11-09 15:14:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:47,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525612766] [2020-11-09 15:14:47,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:47,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:14:47,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485377941] [2020-11-09 15:14:47,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:47,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:47,981 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 69 transitions. [2020-11-09 15:14:47,981 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:48,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:14:48,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9249#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 15:14:48,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:14:48,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:14:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:14:48,572 INFO L87 Difference]: Start difference. First operand 694 states and 2138 transitions. Second operand 5 states. [2020-11-09 15:14:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:48,667 INFO L93 Difference]: Finished difference Result 475 states and 1314 transitions. [2020-11-09 15:14:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:14:48,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 15:14:48,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:48,671 INFO L225 Difference]: With dead ends: 475 [2020-11-09 15:14:48,672 INFO L226 Difference]: Without dead ends: 295 [2020-11-09 15:14:48,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:14:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-11-09 15:14:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2020-11-09 15:14:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-11-09 15:14:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 705 transitions. [2020-11-09 15:14:48,684 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 705 transitions. Word has length 13 [2020-11-09 15:14:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:48,684 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 705 transitions. [2020-11-09 15:14:48,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:14:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 705 transitions. [2020-11-09 15:14:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 15:14:48,686 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:48,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:48,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:14:48,686 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1139253865, now seen corresponding path program 1 times [2020-11-09 15:14:48,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:48,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532501010] [2020-11-09 15:14:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:48,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532501010] [2020-11-09 15:14:48,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:48,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:14:48,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1893012058] [2020-11-09 15:14:48,958 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:48,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:48,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 61 transitions. [2020-11-09 15:14:48,986 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:49,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:49,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,056 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,067 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:49,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,074 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,175 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:49,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,177 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,184 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:49,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:49,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:14:49,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:14:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:14:49,291 INFO L87 Difference]: Start difference. First operand 295 states and 705 transitions. Second operand 6 states. [2020-11-09 15:14:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:49,371 INFO L93 Difference]: Finished difference Result 272 states and 657 transitions. [2020-11-09 15:14:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:14:49,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 15:14:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:49,374 INFO L225 Difference]: With dead ends: 272 [2020-11-09 15:14:49,374 INFO L226 Difference]: Without dead ends: 257 [2020-11-09 15:14:49,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:14:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-11-09 15:14:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2020-11-09 15:14:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-11-09 15:14:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 629 transitions. [2020-11-09 15:14:49,385 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 629 transitions. Word has length 19 [2020-11-09 15:14:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:49,386 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 629 transitions. [2020-11-09 15:14:49,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:14:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 629 transitions. [2020-11-09 15:14:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 15:14:49,387 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:49,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:49,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:14:49,388 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1412155836, now seen corresponding path program 1 times [2020-11-09 15:14:49,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:49,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358398709] [2020-11-09 15:14:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:49,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358398709] [2020-11-09 15:14:49,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:49,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:14:49,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439127863] [2020-11-09 15:14:49,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:49,529 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:49,578 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 137 transitions. [2020-11-09 15:14:49,578 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:49,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:49,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:49,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:49,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,692 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:49,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:49,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:49,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:49,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:49,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:49,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:49,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:49,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,936 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,937 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,938 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:49,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:49,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:49,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:50,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,050 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:50,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,057 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:50,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,159 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:50,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,232 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:50,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,234 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,331 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:50,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:14:50,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:14:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:14:50,333 INFO L87 Difference]: Start difference. First operand 257 states and 629 transitions. Second operand 4 states. [2020-11-09 15:14:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:50,357 INFO L93 Difference]: Finished difference Result 355 states and 851 transitions. [2020-11-09 15:14:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:14:50,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-09 15:14:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:50,359 INFO L225 Difference]: With dead ends: 355 [2020-11-09 15:14:50,359 INFO L226 Difference]: Without dead ends: 161 [2020-11-09 15:14:50,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:14:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-09 15:14:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-11-09 15:14:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-11-09 15:14:50,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 353 transitions. [2020-11-09 15:14:50,366 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 353 transitions. Word has length 23 [2020-11-09 15:14:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:50,366 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 353 transitions. [2020-11-09 15:14:50,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:14:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 353 transitions. [2020-11-09 15:14:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 15:14:50,368 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:50,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:50,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:14:50,369 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1248765852, now seen corresponding path program 2 times [2020-11-09 15:14:50,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:50,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116121169] [2020-11-09 15:14:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:50,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116121169] [2020-11-09 15:14:50,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:50,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:14:50,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129540268] [2020-11-09 15:14:50,496 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:50,506 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:50,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 94 transitions. [2020-11-09 15:14:50,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:50,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:50,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,572 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:50,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:50,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:50,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:50,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,701 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:50,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:50,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:50,764 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:14:50,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:14:50,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:14:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:50,768 INFO L87 Difference]: Start difference. First operand 161 states and 353 transitions. Second operand 3 states. [2020-11-09 15:14:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:50,794 INFO L93 Difference]: Finished difference Result 208 states and 451 transitions. [2020-11-09 15:14:50,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:14:50,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-09 15:14:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:50,796 INFO L225 Difference]: With dead ends: 208 [2020-11-09 15:14:50,796 INFO L226 Difference]: Without dead ends: 116 [2020-11-09 15:14:50,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:14:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-11-09 15:14:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-11-09 15:14:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-09 15:14:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 243 transitions. [2020-11-09 15:14:50,802 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 243 transitions. Word has length 23 [2020-11-09 15:14:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:50,802 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 243 transitions. [2020-11-09 15:14:50,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:14:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 243 transitions. [2020-11-09 15:14:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 15:14:50,803 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:50,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:50,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:14:50,804 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2120045008, now seen corresponding path program 3 times [2020-11-09 15:14:50,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:50,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389003791] [2020-11-09 15:14:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:14:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:14:51,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389003791] [2020-11-09 15:14:51,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:14:51,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:14:51,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464174803] [2020-11-09 15:14:51,202 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:14:51,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:14:51,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 99 states and 187 transitions. [2020-11-09 15:14:51,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:14:51,325 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,327 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,328 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,330 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:51,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:51,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,491 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,523 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,525 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,526 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:51,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:14:51,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:14:51,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,594 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,595 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:14:51,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:14:51,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:51,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,976 WARN L194 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2020-11-09 15:14:51,979 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:51,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:51,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,983 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,985 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:51,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:51,986 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:51,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,056 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:52,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,062 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,123 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,124 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:52,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:52,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,205 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,266 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,267 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,269 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:52,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,271 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:52,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,439 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:14:52,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:14:52,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:52,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:14:52,840 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 27 [2020-11-09 15:14:52,849 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:14:52,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:14:52,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:52,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:52,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:14:52,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:14:53,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,451 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2020-11-09 15:14:53,455 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,456 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,459 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,461 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,462 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,571 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,684 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:53,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,908 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:53,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:53,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:53,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:53,916 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:53,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:54,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:54,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:54,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:54,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:54,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,110 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:54,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,112 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:54,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,113 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:54,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:54,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,116 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:54,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,205 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:14:54,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:54,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,208 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:54,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,210 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:54,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:54,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,293 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:54,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:14:54,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:14:54,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:14:54,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:14:54,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:14:54,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [12247#(and (or (= ~a~0 1) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (= ~a$r_buff1_thd3~0 0) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= (mod ~a$r_buff1_thd2~0 256) 0)) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a~0 1)) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (= ~a$r_buff0_thd3~0 0)), 12248#(and (or (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (or (= (mod ~a$r_buff1_thd2~0 256) 0) (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff0_thd3~0 0)), 12249#(and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0))] [2020-11-09 15:14:54,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:14:54,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:14:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:14:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:14:54,424 INFO L87 Difference]: Start difference. First operand 116 states and 243 transitions. Second operand 10 states. [2020-11-09 15:14:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:14:54,609 INFO L93 Difference]: Finished difference Result 136 states and 278 transitions. [2020-11-09 15:14:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:14:54,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-09 15:14:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:14:54,611 INFO L225 Difference]: With dead ends: 136 [2020-11-09 15:14:54,611 INFO L226 Difference]: Without dead ends: 70 [2020-11-09 15:14:54,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 21 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:14:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-09 15:14:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-11-09 15:14:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 15:14:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 123 transitions. [2020-11-09 15:14:54,615 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 123 transitions. Word has length 23 [2020-11-09 15:14:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:14:54,615 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 123 transitions. [2020-11-09 15:14:54,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:14:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 123 transitions. [2020-11-09 15:14:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 15:14:54,616 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:14:54,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:14:54,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:14:54,617 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:14:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:14:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1204585044, now seen corresponding path program 4 times [2020-11-09 15:14:54,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:14:54,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670388085] [2020-11-09 15:14:54,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:14:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:14:54,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:14:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:14:54,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:14:54,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:14:54,845 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:14:54,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:14:55,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:14:55 BasicIcfg [2020-11-09 15:14:55,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:14:55,023 INFO L168 Benchmark]: Toolchain (without parser) took 22932.74 ms. Allocated memory was 157.3 MB in the beginning and 361.8 MB in the end (delta: 204.5 MB). Free memory was 131.7 MB in the beginning and 150.3 MB in the end (delta: -18.5 MB). Peak memory consumption was 186.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,023 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 157.3 MB. Free memory is still 130.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:14:55,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1031.96 ms. Allocated memory is still 157.3 MB. Free memory was 131.0 MB in the beginning and 132.7 MB in the end (delta: -1.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.92 ms. Allocated memory is still 157.3 MB. Free memory was 132.7 MB in the beginning and 130.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,026 INFO L168 Benchmark]: Boogie Preprocessor took 94.73 ms. Allocated memory is still 157.3 MB. Free memory was 130.1 MB in the beginning and 128.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,027 INFO L168 Benchmark]: RCFGBuilder took 2712.98 ms. Allocated memory was 157.3 MB in the beginning and 189.8 MB in the end (delta: 32.5 MB). Free memory was 128.0 MB in the beginning and 119.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 98.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,028 INFO L168 Benchmark]: TraceAbstraction took 18932.27 ms. Allocated memory was 189.8 MB in the beginning and 361.8 MB in the end (delta: 172.0 MB). Free memory was 119.1 MB in the beginning and 150.3 MB in the end (delta: -31.2 MB). Peak memory consumption was 140.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:14:55,032 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72 ms. Allocated memory is still 157.3 MB. Free memory is still 130.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1031.96 ms. Allocated memory is still 157.3 MB. Free memory was 131.0 MB in the beginning and 132.7 MB in the end (delta: -1.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 128.92 ms. Allocated memory is still 157.3 MB. Free memory was 132.7 MB in the beginning and 130.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 94.73 ms. Allocated memory is still 157.3 MB. Free memory was 130.1 MB in the beginning and 128.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2712.98 ms. Allocated memory was 157.3 MB in the beginning and 189.8 MB in the end (delta: 32.5 MB). Free memory was 128.0 MB in the beginning and 119.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 98.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 18932.27 ms. Allocated memory was 189.8 MB in the beginning and 361.8 MB in the end (delta: 172.0 MB). Free memory was 119.1 MB in the beginning and 150.3 MB in the end (delta: -31.2 MB). Peak memory consumption was 140.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1195 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 98 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 115 PlacesBefore, 38 PlacesAfterwards, 108 TransitionsBefore, 29 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 97 TotalNumberOfCompositions, 6369 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t654; [L849] FCALL, FORK 0 pthread_create(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L850] 0 pthread_t t655; [L851] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t656; [L853] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, weak$$choice2=0, x=1, y=0, z=0] [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 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) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] 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) [L790] 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) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 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 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L804] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] [L770] 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) [L770] 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) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 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 [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 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 [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix024_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 233 SDtfs, 210 SDslu, 378 SDs, 0 SdLazy, 138 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 163 SyntacticMatches, 25 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1136occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 9078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...