/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:58:10,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:58:10,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:58:10,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:58:10,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:58:10,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:58:10,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:58:10,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:58:10,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:58:10,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:58:10,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:58:10,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:58:10,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:58:10,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:58:10,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:58:10,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:58:10,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:58:10,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:58:10,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:58:10,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:58:10,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:58:10,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:58:10,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:58:10,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:58:10,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:58:10,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:58:10,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:58:10,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:58:10,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:58:10,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:58:10,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:58:10,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:58:10,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:58:10,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:58:10,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:58:10,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:58:10,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:58:10,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:58:10,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:58:10,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:58:10,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:58:10,238 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-10-21 23:58:10,260 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:58:10,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:58:10,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:58:10,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:58:10,262 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:58:10,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:58:10,262 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:58:10,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:58:10,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:58:10,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:58:10,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:58:10,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:58:10,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:58:10,264 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:58:10,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:58:10,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:58:10,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:58:10,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:58:10,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:58:10,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:58:10,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:58:10,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:58:10,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:58:10,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:58:10,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:58:10,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:58:10,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:58:10,266 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-21 23:58:10,267 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:58:10,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:58:10,267 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-21 23:58:10,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:58:10,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:58:10,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:58:10,643 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:58:10,643 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:58:10,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i [2020-10-21 23:58:10,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686ca4e40/05bb28fca6d948dcb8215c4bb82a2023/FLAGbb89c0413 [2020-10-21 23:58:11,316 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:58:11,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004_pso.oepc.i [2020-10-21 23:58:11,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686ca4e40/05bb28fca6d948dcb8215c4bb82a2023/FLAGbb89c0413 [2020-10-21 23:58:11,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686ca4e40/05bb28fca6d948dcb8215c4bb82a2023 [2020-10-21 23:58:11,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:58:11,561 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:58:11,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:58:11,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:58:11,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:58:11,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:58:11" (1/1) ... [2020-10-21 23:58:11,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fba72e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:11, skipping insertion in model container [2020-10-21 23:58:11,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:58:11" (1/1) ... [2020-10-21 23:58:11,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:58:11,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:58:12,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:58:12,226 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:58:12,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:58:12,372 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:58:12,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12 WrapperNode [2020-10-21 23:58:12,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:58:12,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:58:12,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:58:12,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:58:12,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:58:12,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:58:12,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:58:12,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:58:12,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... [2020-10-21 23:58:12,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:58:12,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:58:12,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:58:12,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:58:12,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:58:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:58:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:58:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:58:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:58:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:58:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:58:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:58:12,564 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:58:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:58:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:58:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:58:12,565 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:58:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:58:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:58:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:58:12,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:58:12,569 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:58:14,938 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:58:14,938 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:58:14,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:58:14 BoogieIcfgContainer [2020-10-21 23:58:14,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:58:14,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:58:14,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:58:14,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:58:14,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:58:11" (1/3) ... [2020-10-21 23:58:14,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75089351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:58:14, skipping insertion in model container [2020-10-21 23:58:14,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:58:12" (2/3) ... [2020-10-21 23:58:14,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75089351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:58:14, skipping insertion in model container [2020-10-21 23:58:14,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:58:14" (3/3) ... [2020-10-21 23:58:14,951 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004_pso.oepc.i [2020-10-21 23:58:14,963 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:58:14,964 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:58:14,974 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:58:14,975 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:58:15,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,032 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,033 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,033 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,038 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,038 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,041 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,041 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,044 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,044 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,044 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,045 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,046 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,047 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,048 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,049 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,050 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,060 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,060 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,066 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,069 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,070 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,074 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,080 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,081 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:58:15,083 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:58:15,098 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:58:15,122 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:58:15,122 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:58:15,122 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:58:15,122 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-21 23:58:15,123 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:58:15,123 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:58:15,123 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:58:15,123 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:58:15,140 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:58:15,141 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 125 transitions, 270 flow [2020-10-21 23:58:15,144 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 125 transitions, 270 flow [2020-10-21 23:58:15,146 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 135 places, 125 transitions, 270 flow [2020-10-21 23:58:15,211 INFO L129 PetriNetUnfolder]: 3/121 cut-off events. [2020-10-21 23:58:15,211 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:58:15,218 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-10-21 23:58:15,223 INFO L116 LiptonReduction]: Number of co-enabled transitions 3134 [2020-10-21 23:58:15,918 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:58:16,333 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-21 23:58:16,984 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:58:18,830 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-10-21 23:58:19,065 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 23:58:19,079 INFO L131 LiptonReduction]: Checked pairs total: 10697 [2020-10-21 23:58:19,079 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 23:58:19,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 38 transitions, 96 flow [2020-10-21 23:58:19,705 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7994 states. [2020-10-21 23:58:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7994 states. [2020-10-21 23:58:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:58:19,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:19,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:58:19,716 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1254875, now seen corresponding path program 1 times [2020-10-21 23:58:19,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:19,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134801200] [2020-10-21 23:58:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:19,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134801200] [2020-10-21 23:58:19,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:19,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:58:19,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [807509910] [2020-10-21 23:58:19,985 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:19,988 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:20,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-21 23:58:20,001 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:20,005 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:20,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:58:20,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:58:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:58:20,024 INFO L87 Difference]: Start difference. First operand 7994 states. Second operand 3 states. [2020-10-21 23:58:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:20,229 INFO L93 Difference]: Finished difference Result 6662 states and 27160 transitions. [2020-10-21 23:58:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:58:20,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:58:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:20,326 INFO L225 Difference]: With dead ends: 6662 [2020-10-21 23:58:20,329 INFO L226 Difference]: Without dead ends: 4862 [2020-10-21 23:58:20,332 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-10-21 23:58:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-10-21 23:58:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-10-21 23:58:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-10-21 23:58:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-10-21 23:58:20,774 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3 [2020-10-21 23:58:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:20,774 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-10-21 23:58:20,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:58:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-10-21 23:58:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:58:20,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:20,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:20,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:58:20,780 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1347264224, now seen corresponding path program 1 times [2020-10-21 23:58:20,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:20,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118583441] [2020-10-21 23:58:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:20,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118583441] [2020-10-21 23:58:20,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:20,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:58:20,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859884431] [2020-10-21 23:58:20,927 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:20,929 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:20,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-21 23:58:20,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:20,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:20,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:58:20,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:58:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:58:20,935 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 4 states. [2020-10-21 23:58:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:21,055 INFO L93 Difference]: Finished difference Result 5162 states and 20060 transitions. [2020-10-21 23:58:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:58:21,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:58:21,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:21,099 INFO L225 Difference]: With dead ends: 5162 [2020-10-21 23:58:21,099 INFO L226 Difference]: Without dead ends: 4262 [2020-10-21 23:58:21,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:58:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-10-21 23:58:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2020-10-21 23:58:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2020-10-21 23:58:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions. [2020-10-21 23:58:21,300 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12 [2020-10-21 23:58:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:21,301 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions. [2020-10-21 23:58:21,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:58:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions. [2020-10-21 23:58:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:58:21,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:21,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:21,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:58:21,307 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash 377446790, now seen corresponding path program 1 times [2020-10-21 23:58:21,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:21,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933377308] [2020-10-21 23:58:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:21,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933377308] [2020-10-21 23:58:21,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:21,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:58:21,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1137583614] [2020-10-21 23:58:21,423 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:21,426 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:21,432 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-21 23:58:21,432 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:21,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:21,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:58:21,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:58:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:58:21,558 INFO L87 Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand 4 states. [2020-10-21 23:58:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:21,619 INFO L93 Difference]: Finished difference Result 4462 states and 17190 transitions. [2020-10-21 23:58:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:58:21,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:58:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:21,657 INFO L225 Difference]: With dead ends: 4462 [2020-10-21 23:58:21,658 INFO L226 Difference]: Without dead ends: 3862 [2020-10-21 23:58:21,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:58:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2020-10-21 23:58:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3862. [2020-10-21 23:58:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2020-10-21 23:58:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 15080 transitions. [2020-10-21 23:58:21,820 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 15080 transitions. Word has length 14 [2020-10-21 23:58:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:21,821 INFO L481 AbstractCegarLoop]: Abstraction has 3862 states and 15080 transitions. [2020-10-21 23:58:21,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:58:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 15080 transitions. [2020-10-21 23:58:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:58:21,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:21,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:21,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:58:21,827 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 878939332, now seen corresponding path program 1 times [2020-10-21 23:58:21,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:21,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740666754] [2020-10-21 23:58:21,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:22,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740666754] [2020-10-21 23:58:22,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:22,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:58:22,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175188599] [2020-10-21 23:58:22,007 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:22,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:22,015 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-10-21 23:58:22,015 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:22,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-21 23:58:22,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:58:22,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:22,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:58:22,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:58:22,343 INFO L87 Difference]: Start difference. First operand 3862 states and 15080 transitions. Second operand 4 states. [2020-10-21 23:58:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:22,426 INFO L93 Difference]: Finished difference Result 3674 states and 12980 transitions. [2020-10-21 23:58:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:58:22,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 23:58:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:22,442 INFO L225 Difference]: With dead ends: 3674 [2020-10-21 23:58:22,442 INFO L226 Difference]: Without dead ends: 2774 [2020-10-21 23:58:22,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:58:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2020-10-21 23:58:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2020-10-21 23:58:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-10-21 23:58:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 9640 transitions. [2020-10-21 23:58:22,536 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 9640 transitions. Word has length 16 [2020-10-21 23:58:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:22,536 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 9640 transitions. [2020-10-21 23:58:22,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:58:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 9640 transitions. [2020-10-21 23:58:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:58:22,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:22,542 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-10-21 23:58:22,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:58:22,542 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1734076636, now seen corresponding path program 1 times [2020-10-21 23:58:22,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:22,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215447706] [2020-10-21 23:58:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:22,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215447706] [2020-10-21 23:58:22,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:22,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:58:22,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666215720] [2020-10-21 23:58:22,703 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:22,707 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:22,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-10-21 23:58:22,715 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:23,076 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [67632#(<= ~__unbuffered_cnt~0 0)] [2020-10-21 23:58:23,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:58:23,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:58:23,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:58:23,078 INFO L87 Difference]: Start difference. First operand 2774 states and 9640 transitions. Second operand 6 states. [2020-10-21 23:58:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:23,153 INFO L93 Difference]: Finished difference Result 2218 states and 7116 transitions. [2020-10-21 23:58:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:58:23,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:58:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:23,162 INFO L225 Difference]: With dead ends: 2218 [2020-10-21 23:58:23,162 INFO L226 Difference]: Without dead ends: 1718 [2020-10-21 23:58:23,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:58:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-10-21 23:58:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2020-10-21 23:58:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-10-21 23:58:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 5416 transitions. [2020-10-21 23:58:23,220 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 5416 transitions. Word has length 19 [2020-10-21 23:58:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:23,221 INFO L481 AbstractCegarLoop]: Abstraction has 1718 states and 5416 transitions. [2020-10-21 23:58:23,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:58:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 5416 transitions. [2020-10-21 23:58:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:58:23,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:23,227 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] [2020-10-21 23:58:23,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:58:23,227 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2031842376, now seen corresponding path program 1 times [2020-10-21 23:58:23,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:23,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747721599] [2020-10-21 23:58:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:23,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747721599] [2020-10-21 23:58:23,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:23,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:58:23,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1367399661] [2020-10-21 23:58:23,473 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:23,478 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:23,489 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-10-21 23:58:23,490 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:24,243 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-21 23:58:24,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [73295#(<= ~__unbuffered_cnt~0 0)] [2020-10-21 23:58:24,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:58:24,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:24,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:58:24,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:58:24,417 INFO L87 Difference]: Start difference. First operand 1718 states and 5416 transitions. Second operand 7 states. [2020-10-21 23:58:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:24,515 INFO L93 Difference]: Finished difference Result 1470 states and 4633 transitions. [2020-10-21 23:58:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:58:24,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:58:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:24,522 INFO L225 Difference]: With dead ends: 1470 [2020-10-21 23:58:24,522 INFO L226 Difference]: Without dead ends: 1330 [2020-10-21 23:58:24,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:58:24,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2020-10-21 23:58:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-10-21 23:58:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-21 23:58:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4252 transitions. [2020-10-21 23:58:24,586 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4252 transitions. Word has length 22 [2020-10-21 23:58:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:24,586 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 4252 transitions. [2020-10-21 23:58:24,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:58:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4252 transitions. [2020-10-21 23:58:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 23:58:24,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:24,592 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, 1, 1, 1] [2020-10-21 23:58:24,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:58:24,592 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -270830438, now seen corresponding path program 1 times [2020-10-21 23:58:24,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:24,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346152686] [2020-10-21 23:58:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:25,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346152686] [2020-10-21 23:58:25,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:25,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:58:25,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122487549] [2020-10-21 23:58:25,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:25,094 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:25,156 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 236 transitions. [2020-10-21 23:58:25,156 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:25,333 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 214 [2020-10-21 23:58:25,455 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-21 23:58:25,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,456 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:25,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,458 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-21 23:58:25,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,461 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:25,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:25,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:25,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-21 23:58:25,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,474 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-10-21 23:58:25,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,476 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-10-21 23:58:25,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:25,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:25,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:25,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:25,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:25,974 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 214 [2020-10-21 23:58:26,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-21 23:58:26,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,072 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,075 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-21 23:58:26,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,085 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-10-21 23:58:26,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,087 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-10-21 23:58:26,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-21 23:58:26,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,433 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-21 23:58:26,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,439 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:26,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:26,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,458 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,518 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,534 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,544 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,556 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,576 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:58:26,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,599 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-21 23:58:26,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,619 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,630 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:58:26,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,643 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,670 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:26,684 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:26,696 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:26,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,720 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:26,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:26,983 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2020-10-21 23:58:27,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:27,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,080 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:27,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:27,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 2, 1] term [2020-10-21 23:58:27,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,120 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,134 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:27,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,444 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 30 [2020-10-21 23:58:27,769 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2020-10-21 23:58:27,776 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-21 23:58:27,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-21 23:58:27,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:27,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:27,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,787 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,810 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,816 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,826 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,833 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:58:27,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,861 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:27,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:27,890 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:27,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,903 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-21 23:58:27,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,925 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:27,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-21 23:58:27,959 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:58:27,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:27,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:27,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,191 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 97 [2020-10-21 23:58:28,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-21 23:58:28,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-21 23:58:28,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:28,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:28,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:28,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:28,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,228 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,234 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,256 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,267 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,276 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:58:28,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,311 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-21 23:58:28,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,320 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,329 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:28,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:28,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:28,342 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:28,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,355 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,370 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:28,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,383 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:28,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:28,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-21 23:58:28,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:58:29,052 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-10-21 23:58:29,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:29,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,062 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:29,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:29,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,067 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:29,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:29,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:29,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,074 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:29,078 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:29,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:29,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,305 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 31 [2020-10-21 23:58:29,541 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 33 [2020-10-21 23:58:29,673 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 94 [2020-10-21 23:58:29,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:29,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:29,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:29,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:29,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:29,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:29,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:29,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,706 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:29,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-21 23:58:29,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:29,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:29,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:29,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:29,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:29,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:29,991 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-21 23:58:29,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term [2020-10-21 23:58:30,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term [2020-10-21 23:58:30,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:30,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-21 23:58:30,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,503 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,507 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,518 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,524 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,529 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,543 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-21 23:58:30,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,555 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-21 23:58:30,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,565 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:58:30,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,579 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,586 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,592 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:30,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:30,607 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,616 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:30,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,623 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:30,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:30,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:31,276 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 29 [2020-10-21 23:58:31,429 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 31 [2020-10-21 23:58:32,061 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 125 [2020-10-21 23:58:32,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term [2020-10-21 23:58:32,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:32,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:32,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:32,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,094 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:32,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-21 23:58:32,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,111 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:32,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,439 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 31 [2020-10-21 23:58:32,711 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2020-10-21 23:58:32,721 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:32,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,722 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:32,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:32,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:32,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,740 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-21 23:58:32,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:32,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:32,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:32,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-21 23:58:32,774 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:32,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:32,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:32,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:33,299 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2020-10-21 23:58:33,640 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2020-10-21 23:58:34,017 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 31 [2020-10-21 23:58:34,994 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 125 [2020-10-21 23:58:35,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:35,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:35,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:35,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,009 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:35,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:35,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:35,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,016 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:35,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,029 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:35,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:35,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,594 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2020-10-21 23:58:35,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:35,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-21 23:58:35,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-21 23:58:35,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-21 23:58:35,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:35,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-21 23:58:35,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,613 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:35,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,626 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-21 23:58:35,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-21 23:58:35,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-21 23:58:35,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-21 23:58:35,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [77440#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd4~0 0))), 77437#(and (= (mod ~a$w_buff1_used~0 256) 0) (or (and (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0)) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0))))), 77436#(and (= (mod ~a$w_buff1_used~0 256) 0) (= ~a$r_buff0_thd4~0 0) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= (mod ~a$w_buff0_used~0 256) 0)) (not (= ~a~0 0))), 77439#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd4~0 0)), 77438#(and (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256))) (= ~a$r_buff1_thd4~0 0) (not (= ~a~0 0)))) (or (= (mod ~a$w_buff0_used~0 256) 0) (and (= ~a$w_buff1_used~0 0) (= ~a$r_buff0_thd4~0 0) (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0))))] [2020-10-21 23:58:35,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 23:58:35,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 23:58:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:58:35,807 INFO L87 Difference]: Start difference. First operand 1330 states and 4252 transitions. Second operand 13 states. [2020-10-21 23:58:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:36,378 INFO L93 Difference]: Finished difference Result 1857 states and 5810 transitions. [2020-10-21 23:58:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:58:36,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-10-21 23:58:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:36,385 INFO L225 Difference]: With dead ends: 1857 [2020-10-21 23:58:36,385 INFO L226 Difference]: Without dead ends: 1640 [2020-10-21 23:58:36,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-21 23:58:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2020-10-21 23:58:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1330. [2020-10-21 23:58:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-21 23:58:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4190 transitions. [2020-10-21 23:58:36,429 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4190 transitions. Word has length 26 [2020-10-21 23:58:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:36,429 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 4190 transitions. [2020-10-21 23:58:36,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 23:58:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4190 transitions. [2020-10-21 23:58:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 23:58:36,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:36,434 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, 1, 1, 1] [2020-10-21 23:58:36,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:58:36,435 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 390931098, now seen corresponding path program 2 times [2020-10-21 23:58:36,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:36,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490727654] [2020-10-21 23:58:36,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:58:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:58:36,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490727654] [2020-10-21 23:58:36,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:58:36,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:58:36,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774911928] [2020-10-21 23:58:36,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-21 23:58:36,596 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-21 23:58:36,642 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 182 transitions. [2020-10-21 23:58:36,642 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-21 23:58:37,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [81973#(<= ~__unbuffered_cnt~0 0)] [2020-10-21 23:58:37,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:58:37,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:58:37,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:58:37,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:58:37,643 INFO L87 Difference]: Start difference. First operand 1330 states and 4190 transitions. Second operand 8 states. [2020-10-21 23:58:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:58:37,733 INFO L93 Difference]: Finished difference Result 1285 states and 4099 transitions. [2020-10-21 23:58:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:58:37,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-21 23:58:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:58:37,741 INFO L225 Difference]: With dead ends: 1285 [2020-10-21 23:58:37,741 INFO L226 Difference]: Without dead ends: 942 [2020-10-21 23:58:37,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:58:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2020-10-21 23:58:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2020-10-21 23:58:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2020-10-21 23:58:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2970 transitions. [2020-10-21 23:58:37,801 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2970 transitions. Word has length 26 [2020-10-21 23:58:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:58:37,801 INFO L481 AbstractCegarLoop]: Abstraction has 942 states and 2970 transitions. [2020-10-21 23:58:37,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:58:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2970 transitions. [2020-10-21 23:58:37,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 23:58:37,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:58:37,805 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:58:37,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:58:37,805 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:58:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:58:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1430875690, now seen corresponding path program 1 times [2020-10-21 23:58:37,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:58:37,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80633377] [2020-10-21 23:58:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:58:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:58:37,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:58:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:58:37,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:58:37,992 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:58:37,992 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:58:37,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:58:38,025 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,026 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [755] [2020-10-21 23:58:38,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:58:38,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:58:38,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:58:38 BasicIcfg [2020-10-21 23:58:38,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:58:38,133 INFO L168 Benchmark]: Toolchain (without parser) took 26577.77 ms. Allocated memory was 144.7 MB in the beginning and 684.7 MB in the end (delta: 540.0 MB). Free memory was 99.3 MB in the beginning and 533.1 MB in the end (delta: -433.9 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,134 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.38 ms. Allocated memory was 144.7 MB in the beginning and 198.7 MB in the end (delta: 54.0 MB). Free memory was 98.4 MB in the beginning and 147.5 MB in the end (delta: -49.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 198.7 MB. Free memory was 147.5 MB in the beginning and 144.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,136 INFO L168 Benchmark]: Boogie Preprocessor took 48.78 ms. Allocated memory is still 198.7 MB. Free memory was 144.7 MB in the beginning and 141.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,137 INFO L168 Benchmark]: RCFGBuilder took 2452.78 ms. Allocated memory was 198.7 MB in the beginning and 252.7 MB in the end (delta: 54.0 MB). Free memory was 141.9 MB in the beginning and 134.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,138 INFO L168 Benchmark]: TraceAbstraction took 23188.86 ms. Allocated memory was 252.7 MB in the beginning and 684.7 MB in the end (delta: 432.0 MB). Free memory was 134.0 MB in the beginning and 533.1 MB in the end (delta: -399.1 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:58:38,142 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.19 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.38 ms. Allocated memory was 144.7 MB in the beginning and 198.7 MB in the end (delta: 54.0 MB). Free memory was 98.4 MB in the beginning and 147.5 MB in the end (delta: -49.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.45 ms. Allocated memory is still 198.7 MB. Free memory was 147.5 MB in the beginning and 144.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.78 ms. Allocated memory is still 198.7 MB. Free memory was 144.7 MB in the beginning and 141.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2452.78 ms. Allocated memory was 198.7 MB in the beginning and 252.7 MB in the end (delta: 54.0 MB). Free memory was 141.9 MB in the beginning and 134.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23188.86 ms. Allocated memory was 252.7 MB in the beginning and 684.7 MB in the end (delta: 432.0 MB). Free memory was 134.0 MB in the beginning and 533.1 MB in the end (delta: -399.1 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1587 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 166 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 135 PlacesBefore, 50 PlacesAfterwards, 125 TransitionsBefore, 38 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 10697 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t97; [L874] FCALL, FORK 0 pthread_create(&t97, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix004_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t98; [L876] FCALL, FORK 0 pthread_create(&t98, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t99; [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L792] 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) [L792] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L792] 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) [L792] 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) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$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 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 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 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L878] FCALL, FORK 0 pthread_create(&t99, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, z=0] [L806] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L879] 0 pthread_t t100; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L812] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0] [L815] 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) [L815] 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) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 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_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 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 [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 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_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 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 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L880] FCALL, FORK 0 pthread_create(&t100, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, 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] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, 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] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=1] [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L772] 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) [L772] 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) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 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 [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 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 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] 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) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] 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) [L886] 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) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 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 [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 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 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=1] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix004_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.8s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 349 SDtfs, 616 SDslu, 846 SDs, 0 SdLazy, 285 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 201 SyntacticMatches, 19 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7994occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 310 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 14461 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...