/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:47:42,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:47:42,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:47:42,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:47:42,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:47:42,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:47:42,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:47:42,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:47:42,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:47:42,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:47:42,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:47:42,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:47:42,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:47:42,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:47:42,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:47:42,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:47:42,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:47:42,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:47:42,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:47:42,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:47:42,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:47:42,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:47:42,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:47:42,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:47:42,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:47:42,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:47:42,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:47:42,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:47:42,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:47:42,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:47:42,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:47:42,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:47:42,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:47:42,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:47:42,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:47:42,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:47:42,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:47:42,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:47:42,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:47:42,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:47:42,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:47:42,674 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-SP.epf [2020-11-09 16:47:42,728 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:47:42,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:47:42,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:47:42,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:47:42,732 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:47:42,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:47:42,733 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:47:42,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:47:42,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:47:42,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:47:42,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:47:42,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:47:42,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:47:42,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:47:42,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:47:42,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:47:42,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:47:42,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:47:42,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:47:42,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:47:42,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:47:42,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:47:42,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:47:42,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:47:42,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:47:42,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:47:42,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:47:42,739 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:47:42,739 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:47:42,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:47:42,740 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:47:43,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:47:43,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:47:43,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:47:43,216 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:47:43,216 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:47:43,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2020-11-09 16:47:43,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a90a5a2c/b419c2d2b6384136b2ff7fe39e379a83/FLAG29cbe571e [2020-11-09 16:47:44,077 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:47:44,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2020-11-09 16:47:44,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a90a5a2c/b419c2d2b6384136b2ff7fe39e379a83/FLAG29cbe571e [2020-11-09 16:47:44,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a90a5a2c/b419c2d2b6384136b2ff7fe39e379a83 [2020-11-09 16:47:44,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:47:44,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:47:44,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:47:44,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:47:44,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:47:44,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:47:44" (1/1) ... [2020-11-09 16:47:44,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9fd9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:44, skipping insertion in model container [2020-11-09 16:47:44,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:47:44" (1/1) ... [2020-11-09 16:47:44,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:47:44,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:47:45,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:47:45,021 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:47:45,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:47:45,309 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:47:45,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45 WrapperNode [2020-11-09 16:47:45,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:47:45,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:47:45,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:47:45,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:47:45,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:47:45,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:47:45,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:47:45,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:47:45,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... [2020-11-09 16:47:45,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:47:45,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:47:45,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:47:45,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:47:45,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:47:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:47:45,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:47:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:47:45,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:47:45,589 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:47:45,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:47:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:47:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:47:45,592 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:47:45,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:47:45,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:47:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:47:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:47:45,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:47:45,595 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:47:47,865 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:47:47,866 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:47:47,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:47:47 BoogieIcfgContainer [2020-11-09 16:47:47,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:47:47,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:47:47,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:47:47,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:47:47,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:47:44" (1/3) ... [2020-11-09 16:47:47,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145a9852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:47:47, skipping insertion in model container [2020-11-09 16:47:47,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:47:45" (2/3) ... [2020-11-09 16:47:47,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145a9852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:47:47, skipping insertion in model container [2020-11-09 16:47:47,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:47:47" (3/3) ... [2020-11-09 16:47:47,878 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_pso.oepc.i [2020-11-09 16:47:47,896 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:47:47,896 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:47:47,901 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:47:47,902 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:47:47,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,945 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,945 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,947 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,948 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,949 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,961 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,962 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,962 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:47,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,016 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,016 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,017 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,017 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,018 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,022 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,023 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:47:48,029 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:47:48,042 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 16:47:48,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:47:48,067 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:47:48,068 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:47:48,068 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:47:48,068 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:47:48,068 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:47:48,068 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:47:48,068 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:47:48,082 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:47:48,082 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 106 transitions, 227 flow [2020-11-09 16:47:48,086 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 227 flow [2020-11-09 16:47:48,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 227 flow [2020-11-09 16:47:48,142 INFO L129 PetriNetUnfolder]: 3/103 cut-off events. [2020-11-09 16:47:48,143 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:47:48,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 3/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-11-09 16:47:48,152 INFO L116 LiptonReduction]: Number of co-enabled transitions 2054 [2020-11-09 16:47:49,029 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 16:47:49,248 WARN L194 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 16:47:49,383 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 16:47:49,968 WARN L194 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:47:50,121 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:47:50,669 WARN L194 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 16:47:50,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:47:50,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:47:51,156 WARN L194 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 16:47:51,896 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:47:52,014 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:47:52,255 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 16:47:52,469 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 16:47:53,395 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2020-11-09 16:47:55,127 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-09 16:47:56,516 WARN L194 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:47:56,790 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:47:57,359 WARN L194 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-09 16:47:57,631 WARN L194 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 16:47:57,673 INFO L131 LiptonReduction]: Checked pairs total: 6210 [2020-11-09 16:47:57,673 INFO L133 LiptonReduction]: Total number of compositions: 99 [2020-11-09 16:47:57,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-09 16:47:57,781 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-11-09 16:47:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-11-09 16:47:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 16:47:57,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:57,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 16:47:57,791 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1109984, now seen corresponding path program 1 times [2020-11-09 16:47:57,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:57,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015752453] [2020-11-09 16:47:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:47:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:47:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:47:58,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015752453] [2020-11-09 16:47:58,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:47:58,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:47:58,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530830798] [2020-11-09 16:47:58,127 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:47:58,129 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:47:58,141 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 16:47:58,141 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:47:58,145 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:47:58,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:47:58,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:47:58,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:47:58,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,164 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-11-09 16:47:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:47:58,255 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-11-09 16:47:58,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:47:58,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 16:47:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:47:58,282 INFO L225 Difference]: With dead ends: 812 [2020-11-09 16:47:58,282 INFO L226 Difference]: Without dead ends: 662 [2020-11-09 16:47:58,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-11-09 16:47:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-11-09 16:47:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-11-09 16:47:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-11-09 16:47:58,413 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 3 [2020-11-09 16:47:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:47:58,413 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-11-09 16:47:58,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:47:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-11-09 16:47:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:47:58,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:58,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:47:58,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:47:58,416 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:58,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1836865955, now seen corresponding path program 1 times [2020-11-09 16:47:58,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:58,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853332168] [2020-11-09 16:47:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:47:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:47:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:47:58,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853332168] [2020-11-09 16:47:58,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:47:58,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:47:58,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347325180] [2020-11-09 16:47:58,603 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:47:58,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:47:58,607 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 16:47:58,607 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:47:58,607 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:47:58,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:47:58,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:47:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:47:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,615 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-11-09 16:47:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:47:58,632 INFO L93 Difference]: Finished difference Result 650 states and 2014 transitions. [2020-11-09 16:47:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:47:58,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 16:47:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:47:58,645 INFO L225 Difference]: With dead ends: 650 [2020-11-09 16:47:58,645 INFO L226 Difference]: Without dead ends: 650 [2020-11-09 16:47:58,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2020-11-09 16:47:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2020-11-09 16:47:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2020-11-09 16:47:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2014 transitions. [2020-11-09 16:47:58,686 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2014 transitions. Word has length 9 [2020-11-09 16:47:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:47:58,688 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 2014 transitions. [2020-11-09 16:47:58,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:47:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2014 transitions. [2020-11-09 16:47:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:47:58,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:58,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:47:58,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:47:58,698 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1108270635, now seen corresponding path program 1 times [2020-11-09 16:47:58,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:58,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415082424] [2020-11-09 16:47:58,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:47:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:47:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:47:58,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415082424] [2020-11-09 16:47:58,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:47:58,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:47:58,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1296099091] [2020-11-09 16:47:58,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:47:58,804 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:47:58,806 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-11-09 16:47:58,806 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:47:58,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:47:58,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:47:58,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:47:58,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:47:58,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,887 INFO L87 Difference]: Start difference. First operand 650 states and 2014 transitions. Second operand 3 states. [2020-11-09 16:47:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:47:58,900 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-11-09 16:47:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:47:58,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 16:47:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:47:58,906 INFO L225 Difference]: With dead ends: 604 [2020-11-09 16:47:58,906 INFO L226 Difference]: Without dead ends: 604 [2020-11-09 16:47:58,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:47:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-11-09 16:47:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-11-09 16:47:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-11-09 16:47:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-11-09 16:47:58,932 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 10 [2020-11-09 16:47:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:47:58,932 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-11-09 16:47:58,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:47:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-11-09 16:47:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:47:58,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:58,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:47:58,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:47:58,935 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 103751069, now seen corresponding path program 1 times [2020-11-09 16:47:58,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:58,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182056537] [2020-11-09 16:47:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:47:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:47:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:47:59,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182056537] [2020-11-09 16:47:59,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:47:59,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:47:59,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [347029688] [2020-11-09 16:47:59,051 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:47:59,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:47:59,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 44 transitions. [2020-11-09 16:47:59,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:47:59,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:47:59,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:47:59,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:47:59,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:47:59,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:47:59,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7975#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 16:47:59,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:47:59,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:47:59,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:47:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:47:59,505 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-11-09 16:47:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:47:59,609 INFO L93 Difference]: Finished difference Result 402 states and 1093 transitions. [2020-11-09 16:47:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:47:59,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 16:47:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:47:59,612 INFO L225 Difference]: With dead ends: 402 [2020-11-09 16:47:59,613 INFO L226 Difference]: Without dead ends: 252 [2020-11-09 16:47:59,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:47:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-11-09 16:47:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2020-11-09 16:47:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-09 16:47:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 592 transitions. [2020-11-09 16:47:59,633 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 592 transitions. Word has length 12 [2020-11-09 16:47:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:47:59,634 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 592 transitions. [2020-11-09 16:47:59,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:47:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 592 transitions. [2020-11-09 16:47:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:47:59,637 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:59,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:47:59,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:47:59,637 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -234603554, now seen corresponding path program 1 times [2020-11-09 16:47:59,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:59,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368343689] [2020-11-09 16:47:59,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:47:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:47:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:47:59,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368343689] [2020-11-09 16:47:59,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:47:59,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:47:59,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55878875] [2020-11-09 16:47:59,776 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:47:59,780 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:47:59,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2020-11-09 16:47:59,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:47:59,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:47:59,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:47:59,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:47:59,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,868 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:47:59,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,869 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:47:59,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:47:59,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:47:59,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:47:59,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,922 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:47:59,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:47:59,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:47:59,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:47:59,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:47:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:47:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:47:59,947 INFO L87 Difference]: Start difference. First operand 252 states and 592 transitions. Second operand 4 states. [2020-11-09 16:47:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:47:59,967 INFO L93 Difference]: Finished difference Result 352 states and 806 transitions. [2020-11-09 16:47:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:47:59,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-09 16:47:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:47:59,970 INFO L225 Difference]: With dead ends: 352 [2020-11-09 16:47:59,970 INFO L226 Difference]: Without dead ends: 255 [2020-11-09 16:47:59,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:47:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-11-09 16:47:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2020-11-09 16:47:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-09 16:47:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 565 transitions. [2020-11-09 16:47:59,978 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 565 transitions. Word has length 18 [2020-11-09 16:47:59,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:47:59,979 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 565 transitions. [2020-11-09 16:47:59,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:47:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 565 transitions. [2020-11-09 16:47:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:47:59,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:47:59,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:47:59,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:47:59,980 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:47:59,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:47:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2121137901, now seen corresponding path program 1 times [2020-11-09 16:47:59,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:47:59,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251435820] [2020-11-09 16:47:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:48:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:48:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:48:00,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251435820] [2020-11-09 16:48:00,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:48:00,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:48:00,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1018875822] [2020-11-09 16:48:00,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:48:00,068 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:48:00,083 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 54 transitions. [2020-11-09 16:48:00,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:48:00,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:00,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:00,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,258 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:00,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,324 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:48:00,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:48:00,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:48:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:48:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:48:00,326 INFO L87 Difference]: Start difference. First operand 252 states and 565 transitions. Second operand 3 states. [2020-11-09 16:48:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:48:00,342 INFO L93 Difference]: Finished difference Result 372 states and 810 transitions. [2020-11-09 16:48:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:48:00,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-09 16:48:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:48:00,344 INFO L225 Difference]: With dead ends: 372 [2020-11-09 16:48:00,345 INFO L226 Difference]: Without dead ends: 244 [2020-11-09 16:48:00,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:48:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-11-09 16:48:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2020-11-09 16:48:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-09 16:48:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 504 transitions. [2020-11-09 16:48:00,358 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 504 transitions. Word has length 18 [2020-11-09 16:48:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:48:00,359 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 504 transitions. [2020-11-09 16:48:00,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:48:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 504 transitions. [2020-11-09 16:48:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 16:48:00,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:48:00,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:48:00,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:48:00,364 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:48:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:48:00,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1360204454, now seen corresponding path program 2 times [2020-11-09 16:48:00,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:48:00,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040090245] [2020-11-09 16:48:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:48:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:48:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:48:00,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040090245] [2020-11-09 16:48:00,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:48:00,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:48:00,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [742594029] [2020-11-09 16:48:00,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:48:00,618 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:48:00,658 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-11-09 16:48:00,658 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:48:00,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:48:00,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,754 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,760 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:48:00,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:00,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,825 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:00,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,857 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:00,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:00,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:00,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:00,917 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:48:00,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:48:00,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:48:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:48:00,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:48:00,919 INFO L87 Difference]: Start difference. First operand 241 states and 504 transitions. Second operand 6 states. [2020-11-09 16:48:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:48:00,989 INFO L93 Difference]: Finished difference Result 219 states and 460 transitions. [2020-11-09 16:48:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:48:00,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 16:48:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:48:00,991 INFO L225 Difference]: With dead ends: 219 [2020-11-09 16:48:00,991 INFO L226 Difference]: Without dead ends: 111 [2020-11-09 16:48:00,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:48:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-09 16:48:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-11-09 16:48:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-09 16:48:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 234 transitions. [2020-11-09 16:48:00,996 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 234 transitions. Word has length 18 [2020-11-09 16:48:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:48:00,996 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 234 transitions. [2020-11-09 16:48:00,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:48:00,996 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 234 transitions. [2020-11-09 16:48:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:48:00,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:48:00,997 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-11-09 16:48:00,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:48:00,997 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:48:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:48:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1064448418, now seen corresponding path program 1 times [2020-11-09 16:48:00,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:48:00,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505646398] [2020-11-09 16:48:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:48:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:48:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:48:01,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505646398] [2020-11-09 16:48:01,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:48:01,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:48:01,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751336210] [2020-11-09 16:48:01,343 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:48:01,349 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:48:01,388 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 138 transitions. [2020-11-09 16:48:01,388 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:48:01,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:01,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:01,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,399 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:01,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:01,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:01,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,896 WARN L194 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2020-11-09 16:48:01,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:01,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:01,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,918 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:01,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:01,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:01,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:01,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:02,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:02,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:02,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,131 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,131 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:02,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,135 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:02,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:02,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:02,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:02,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:02,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,334 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 3, 2, 1] term [2020-11-09 16:48:02,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,337 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 1] term [2020-11-09 16:48:02,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 3, 3, 2, 1] term [2020-11-09 16:48:02,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:02,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:02,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:02,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,706 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:02,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:02,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:02,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:02,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 3, 2, 1] term [2020-11-09 16:48:02,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,924 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 1] term [2020-11-09 16:48:02,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,925 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:02,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:02,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:02,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 3, 3, 2, 1] term [2020-11-09 16:48:02,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:03,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:03,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:03,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:03,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 5, 3, 3, 2, 1] term [2020-11-09 16:48:03,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,321 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:03,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,337 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:48:03,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,340 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,340 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,341 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:48:03,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:03,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:03,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,393 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:03,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:03,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:03,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:03,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,888 WARN L194 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2020-11-09 16:48:03,895 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term [2020-11-09 16:48:03,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term [2020-11-09 16:48:03,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:03,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:03,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:03,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-11-09 16:48:03,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:04,294 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2020-11-09 16:48:04,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:04,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:04,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 3, 2, 1] term [2020-11-09 16:48:04,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:04,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 3, 1] term [2020-11-09 16:48:04,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:04,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:04,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:04,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 3, 3, 2, 1] term [2020-11-09 16:48:04,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:04,785 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2020-11-09 16:48:04,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [11065#(and (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= (mod ~a$r_buff1_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (or (= (mod ~a$r_buff0_thd1~0 256) 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a~0 1)) (<= 1 ~__unbuffered_cnt~0) (or (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= (mod ~a$r_buff1_thd1~0 256) 0)) (<= ~__unbuffered_cnt~0 1) (or (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a~0 1)) (= ~a$r_buff0_thd3~0 0)), 11066#(and (= ~__unbuffered_p2_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 11067#(and (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= (mod ~a$r_buff1_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (or (= (mod ~a$r_buff0_thd1~0 256) 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a~0 1)) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (or (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= (mod ~a$r_buff1_thd1~0 256) 0)) (or (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a~0 1)) (= ~a$r_buff0_thd3~0 0)), 11068#(and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (= (mod ~a$r_buff1_thd1~0 256) 0) (= ~a$r_buff0_thd3~0 0)), 11069#(and (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$r_buff1_thd1~0 0) (= ~a$w_buff0~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0))] [2020-11-09 16:48:04,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-09 16:48:04,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:48:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-09 16:48:04,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-11-09 16:48:04,789 INFO L87 Difference]: Start difference. First operand 111 states and 234 transitions. Second operand 16 states. [2020-11-09 16:48:05,536 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2020-11-09 16:48:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:48:05,899 INFO L93 Difference]: Finished difference Result 172 states and 360 transitions. [2020-11-09 16:48:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-09 16:48:05,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2020-11-09 16:48:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:48:05,902 INFO L225 Difference]: With dead ends: 172 [2020-11-09 16:48:05,902 INFO L226 Difference]: Without dead ends: 143 [2020-11-09 16:48:05,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2020-11-09 16:48:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-11-09 16:48:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2020-11-09 16:48:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-11-09 16:48:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 264 transitions. [2020-11-09 16:48:05,908 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 264 transitions. Word has length 22 [2020-11-09 16:48:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:48:05,908 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 264 transitions. [2020-11-09 16:48:05,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-09 16:48:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 264 transitions. [2020-11-09 16:48:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:48:05,909 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:48:05,909 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-11-09 16:48:05,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:48:05,909 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:48:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:48:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -939607692, now seen corresponding path program 2 times [2020-11-09 16:48:05,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:48:05,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799330626] [2020-11-09 16:48:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:48:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:48:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:48:06,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799330626] [2020-11-09 16:48:06,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:48:06,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 16:48:06,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791147785] [2020-11-09 16:48:06,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:48:06,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:48:06,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 150 transitions. [2020-11-09 16:48:06,466 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:48:06,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:06,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:06,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,495 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:06,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,690 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2020-11-09 16:48:06,702 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:06,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,703 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:06,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:06,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,715 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:06,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,809 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:06,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:06,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:06,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:06,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:06,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:06,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,987 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:06,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,988 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:06,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:06,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:06,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:06,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:07,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:48:07,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:07,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:07,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:07,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:07,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:07,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:07,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:07,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:07,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,413 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:07,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,414 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,415 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:07,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:07,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,495 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:07,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 16:48:07,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,571 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,572 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 16:48:07,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 16:48:07,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 5, 3, 3, 2, 1] term [2020-11-09 16:48:07,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:48:07,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 16:48:07,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:48:07,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:48:07,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,845 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2020-11-09 16:48:07,853 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:48:07,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:07,988 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,989 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:07,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:07,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 7, 3, 2, 2, 1] term [2020-11-09 16:48:07,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:08,186 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2020-11-09 16:48:08,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:08,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:08,210 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:48:08,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:48:08,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 16:48:08,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:48:08,502 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 22 [2020-11-09 16:48:08,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [11520#(and (= (mod ~a$r_buff0_thd2~0 256) 0) (<= 1 ~a$w_buff0_used~0) (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd3~0 0)), 11515#(and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (= ~a$r_buff0_thd3~0 0)), 11516#(and (= ~__unbuffered_p2_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 11517#(and (= ~__unbuffered_p2_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 11518#(and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (= ~a$r_buff0_thd3~0 0)), 11519#(and (not (= (mod ~a$w_buff0_used~0 256) 0)) (= (mod ~a$r_buff0_thd2~0 256) 0) (not (= (mod ~a$r_buff0_thd1~0 256) 0)) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (= ~a$r_buff0_thd3~0 0))] [2020-11-09 16:48:08,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-09 16:48:08,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:48:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-09 16:48:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-09 16:48:08,519 INFO L87 Difference]: Start difference. First operand 126 states and 264 transitions. Second operand 17 states. [2020-11-09 16:48:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:48:09,149 INFO L93 Difference]: Finished difference Result 148 states and 295 transitions. [2020-11-09 16:48:09,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 16:48:09,150 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-11-09 16:48:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:48:09,152 INFO L225 Difference]: With dead ends: 148 [2020-11-09 16:48:09,152 INFO L226 Difference]: Without dead ends: 123 [2020-11-09 16:48:09,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-11-09 16:48:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-09 16:48:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2020-11-09 16:48:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-09 16:48:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 222 transitions. [2020-11-09 16:48:09,158 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 222 transitions. Word has length 22 [2020-11-09 16:48:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:48:09,158 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 222 transitions. [2020-11-09 16:48:09,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-09 16:48:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 222 transitions. [2020-11-09 16:48:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 16:48:09,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:48:09,159 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-11-09 16:48:09,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:48:09,159 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:48:09,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:48:09,160 INFO L82 PathProgramCache]: Analyzing trace with hash -798709082, now seen corresponding path program 3 times [2020-11-09 16:48:09,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:48:09,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533481981] [2020-11-09 16:48:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:48:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:48:09,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:48:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:48:09,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:48:09,341 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:48:09,342 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:48:09,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:48:09,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:48:09 BasicIcfg [2020-11-09 16:48:09,457 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:48:09,459 INFO L168 Benchmark]: Toolchain (without parser) took 25068.92 ms. Allocated memory was 151.0 MB in the beginning and 338.7 MB in the end (delta: 187.7 MB). Free memory was 124.5 MB in the beginning and 122.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 190.7 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,460 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 123.5 MB in the end (delta: 77.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:48:09,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.44 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.73 ms. Allocated memory is still 151.0 MB. Free memory was 121.5 MB in the beginning and 118.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,462 INFO L168 Benchmark]: Boogie Preprocessor took 79.23 ms. Allocated memory is still 151.0 MB. Free memory was 118.9 MB in the beginning and 116.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,462 INFO L168 Benchmark]: RCFGBuilder took 2359.12 ms. Allocated memory was 151.0 MB in the beginning and 195.0 MB in the end (delta: 44.0 MB). Free memory was 116.8 MB in the beginning and 91.9 MB in the end (delta: 24.9 MB). Peak memory consumption was 76.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,463 INFO L168 Benchmark]: TraceAbstraction took 21587.22 ms. Allocated memory was 195.0 MB in the beginning and 338.7 MB in the end (delta: 143.7 MB). Free memory was 91.4 MB in the beginning and 122.4 MB in the end (delta: -31.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:48:09,467 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.24 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 123.5 MB in the end (delta: 77.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 911.44 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 121.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 115.73 ms. Allocated memory is still 151.0 MB. Free memory was 121.5 MB in the beginning and 118.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 79.23 ms. Allocated memory is still 151.0 MB. Free memory was 118.9 MB in the beginning and 116.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2359.12 ms. Allocated memory was 151.0 MB in the beginning and 195.0 MB in the end (delta: 44.0 MB). Free memory was 116.8 MB in the beginning and 91.9 MB in the end (delta: 24.9 MB). Peak memory consumption was 76.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21587.22 ms. Allocated memory was 195.0 MB in the beginning and 338.7 MB in the end (delta: 143.7 MB). Free memory was 91.4 MB in the beginning and 122.4 MB in the end (delta: -31.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1113 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 99 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 113 PlacesBefore, 37 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 6210 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1007; [L844] FCALL, FORK 0 pthread_create(&t1007, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1008; [L846] FCALL, FORK 0 pthread_create(&t1008, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1009; [L848] FCALL, FORK 0 pthread_create(&t1009, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 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) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] 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) [L782] 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) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 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 [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 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 [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L762] 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) [L762] 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) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 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 [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 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 [L821] 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) [L821] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L821] 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) [L821] 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) [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L823] 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 [L824] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L825] 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 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] 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) [L854] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L854] 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) [L854] 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) [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L856] 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 [L857] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L858] 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 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix038_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 268 SDtfs, 233 SDslu, 902 SDs, 0 SdLazy, 840 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 93 SyntacticMatches, 26 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 18649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...