/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-15 13:38:59,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-15 13:38:59,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-15 13:39:00,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-15 13:39:00,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-15 13:39:00,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-15 13:39:00,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-15 13:39:00,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-15 13:39:00,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-15 13:39:00,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-15 13:39:00,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-15 13:39:00,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-15 13:39:00,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-15 13:39:00,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-15 13:39:00,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-15 13:39:00,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-15 13:39:00,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-15 13:39:00,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-15 13:39:00,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-15 13:39:00,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-15 13:39:00,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-15 13:39:00,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-15 13:39:00,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-15 13:39:00,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-15 13:39:00,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-15 13:39:00,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-15 13:39:00,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-15 13:39:00,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-15 13:39:00,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-15 13:39:00,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-15 13:39:00,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-15 13:39:00,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-15 13:39:00,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-15 13:39:00,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-15 13:39:00,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-15 13:39:00,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-15 13:39:00,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-15 13:39:00,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-15 13:39:00,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-15 13:39:00,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-15 13:39:00,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-15 13:39:00,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-15 13:39:00,160 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-15 13:39:00,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-15 13:39:00,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-15 13:39:00,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-15 13:39:00,164 INFO L138 SettingsManager]: * Use SBE=true [2020-09-15 13:39:00,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-15 13:39:00,165 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-15 13:39:00,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-15 13:39:00,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-15 13:39:00,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-15 13:39:00,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-15 13:39:00,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-15 13:39:00,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-15 13:39:00,167 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-15 13:39:00,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-15 13:39:00,168 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-15 13:39:00,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-15 13:39:00,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-15 13:39:00,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-15 13:39:00,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-15 13:39:00,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-15 13:39:00,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-15 13:39:00,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-15 13:39:00,170 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-15 13:39:00,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-15 13:39:00,171 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-15 13:39:00,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-15 13:39:00,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-15 13:39:00,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-15 13:39:00,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-15 13:39:00,686 INFO L275 PluginConnector]: CDTParser initialized [2020-09-15 13:39:00,688 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-15 13:39:00,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e8b48a49/f8b607242eb644e6844c27ce6bc3e609/FLAG4946a8b6b [2020-09-15 13:39:01,512 INFO L306 CDTParser]: Found 1 translation units. [2020-09-15 13:39:01,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-15 13:39:01,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e8b48a49/f8b607242eb644e6844c27ce6bc3e609/FLAG4946a8b6b [2020-09-15 13:39:01,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9e8b48a49/f8b607242eb644e6844c27ce6bc3e609 [2020-09-15 13:39:01,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-15 13:39:01,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-15 13:39:01,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-15 13:39:01,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-15 13:39:01,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-15 13:39:01,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 01:39:01" (1/1) ... [2020-09-15 13:39:01,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ef32e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:01, skipping insertion in model container [2020-09-15 13:39:01,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 01:39:01" (1/1) ... [2020-09-15 13:39:01,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-15 13:39:01,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-15 13:39:02,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 13:39:02,572 INFO L203 MainTranslator]: Completed pre-run [2020-09-15 13:39:02,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 13:39:02,794 INFO L208 MainTranslator]: Completed translation [2020-09-15 13:39:02,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02 WrapperNode [2020-09-15 13:39:02,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-15 13:39:02,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-15 13:39:02,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-15 13:39:02,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-15 13:39:02,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-15 13:39:02,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-15 13:39:02,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-15 13:39:02,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-15 13:39:02,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... [2020-09-15 13:39:02,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-15 13:39:02,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-15 13:39:02,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-15 13:39:02,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-15 13:39:02,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-15 13:39:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-09-15 13:39:03,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-09-15 13:39:03,022 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-09-15 13:39:03,023 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-09-15 13:39:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-15 13:39:03,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-15 13:39:03,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-15 13:39:03,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-15 13:39:03,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-15 13:39:03,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-15 13:39:03,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-15 13:39:03,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-15 13:39:03,029 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-15 13:39:03,604 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-15 13:39:03,604 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-15 13:39:03,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 01:39:03 BoogieIcfgContainer [2020-09-15 13:39:03,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-15 13:39:03,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-15 13:39:03,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-15 13:39:03,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-15 13:39:03,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 01:39:01" (1/3) ... [2020-09-15 13:39:03,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@969b610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 01:39:03, skipping insertion in model container [2020-09-15 13:39:03,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 01:39:02" (2/3) ... [2020-09-15 13:39:03,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@969b610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 01:39:03, skipping insertion in model container [2020-09-15 13:39:03,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 01:39:03" (3/3) ... [2020-09-15 13:39:03,621 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-09-15 13:39:03,634 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-15 13:39:03,634 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-15 13:39:03,647 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-09-15 13:39:03,648 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-15 13:39:03,708 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,709 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,709 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,709 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,710 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,710 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,710 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,710 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,711 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,711 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,711 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,711 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,712 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,712 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,712 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,712 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,713 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,713 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,713 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,713 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,713 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,714 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,714 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,714 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,714 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,715 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,715 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,715 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,715 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,716 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,716 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,716 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,716 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,716 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,717 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,717 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,717 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,717 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,717 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,718 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,718 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,718 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,718 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,719 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,720 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,720 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,720 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,721 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,721 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,721 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,721 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,722 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,723 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,723 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,724 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,724 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,725 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,726 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,726 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,726 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,727 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,727 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,727 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,727 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,728 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,728 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,728 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,728 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,729 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,729 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,729 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,730 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,730 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,730 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,730 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,730 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,731 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,731 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,731 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,731 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,731 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,732 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,732 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,732 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,733 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,733 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,733 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,733 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,734 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,734 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,734 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,734 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,735 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,735 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,735 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,735 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,735 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,736 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,736 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,736 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,737 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,737 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,737 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,738 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,738 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,738 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,739 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,745 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,745 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,746 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,746 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,747 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,747 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,748 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,748 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,749 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,759 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,759 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,760 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,760 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,760 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,760 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,761 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,761 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,761 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,761 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,761 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,762 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,762 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,762 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,762 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,762 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,763 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,763 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 13:39:03,798 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-15 13:39:03,832 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-15 13:39:03,832 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-15 13:39:03,833 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-15 13:39:03,833 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-15 13:39:03,833 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-15 13:39:03,833 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-15 13:39:03,833 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-15 13:39:03,833 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-15 13:39:03,858 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-09-15 13:39:03,861 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-15 13:39:03,989 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-15 13:39:03,990 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 13:39:04,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-09-15 13:39:04,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-15 13:39:04,056 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-15 13:39:04,056 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 13:39:04,058 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 138 events. 11/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 106. Up to 3 conditions per place. [2020-09-15 13:39:04,064 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5744 [2020-09-15 13:39:04,066 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-15 13:39:07,215 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-09-15 13:39:07,451 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-15 13:39:07,558 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-09-15 13:39:07,846 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-09-15 13:39:08,078 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-15 13:39:08,092 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7699 [2020-09-15 13:39:08,092 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2020-09-15 13:39:08,097 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-09-15 13:39:08,127 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-09-15 13:39:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-09-15 13:39:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-09-15 13:39:08,139 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:08,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-09-15 13:39:08,141 INFO L427 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-09-15 13:39:08,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:08,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824863548] [2020-09-15 13:39:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:08,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824863548] [2020-09-15 13:39:08,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:08,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 13:39:08,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094728049] [2020-09-15 13:39:08,478 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:08,482 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:08,501 INFO L274 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-09-15 13:39:08,501 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:08,504 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:08,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:39:08,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:08,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:39:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:08,524 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-09-15 13:39:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:08,620 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-09-15 13:39:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:39:08,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-09-15 13:39:08,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:08,649 INFO L225 Difference]: With dead ends: 504 [2020-09-15 13:39:08,650 INFO L226 Difference]: Without dead ends: 460 [2020-09-15 13:39:08,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-15 13:39:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-09-15 13:39:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-09-15 13:39:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-09-15 13:39:08,756 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-09-15 13:39:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:08,757 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-09-15 13:39:08,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:39:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-09-15 13:39:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-15 13:39:08,759 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:08,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:08,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-15 13:39:08,760 INFO L427 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-09-15 13:39:08,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:08,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591633982] [2020-09-15 13:39:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:08,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591633982] [2020-09-15 13:39:08,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:08,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 13:39:08,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552229533] [2020-09-15 13:39:08,958 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:08,959 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:08,963 INFO L274 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-09-15 13:39:08,963 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:08,964 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:39:08,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:39:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:08,968 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-09-15 13:39:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:08,996 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-09-15 13:39:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:39:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-15 13:39:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:09,003 INFO L225 Difference]: With dead ends: 464 [2020-09-15 13:39:09,004 INFO L226 Difference]: Without dead ends: 464 [2020-09-15 13:39:09,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-15 13:39:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-09-15 13:39:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-09-15 13:39:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-09-15 13:39:09,072 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-09-15 13:39:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:09,075 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-09-15 13:39:09,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:39:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-09-15 13:39:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-15 13:39:09,077 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:09,077 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:09,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-15 13:39:09,078 INFO L427 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-09-15 13:39:09,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:09,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960162786] [2020-09-15 13:39:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:09,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960162786] [2020-09-15 13:39:09,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45719351] [2020-09-15 13:39:09,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:09,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-15 13:39:09,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:09,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-15 13:39:09,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-09-15 13:39:09,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306675073] [2020-09-15 13:39:09,396 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:09,398 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:09,426 INFO L274 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-09-15 13:39:09,426 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:09,427 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:09,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-15 13:39:09,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:09,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-15 13:39:09,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-15 13:39:09,428 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 7 states. [2020-09-15 13:39:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:09,604 INFO L93 Difference]: Finished difference Result 866 states and 2152 transitions. [2020-09-15 13:39:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-15 13:39:09,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-09-15 13:39:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:09,614 INFO L225 Difference]: With dead ends: 866 [2020-09-15 13:39:09,614 INFO L226 Difference]: Without dead ends: 851 [2020-09-15 13:39:09,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-09-15 13:39:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-09-15 13:39:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 575. [2020-09-15 13:39:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-09-15 13:39:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1484 transitions. [2020-09-15 13:39:09,645 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1484 transitions. Word has length 13 [2020-09-15 13:39:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:09,646 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 1484 transitions. [2020-09-15 13:39:09,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-15 13:39:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1484 transitions. [2020-09-15 13:39:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-15 13:39:09,657 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:09,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:09,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-15 13:39:09,872 INFO L427 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-09-15 13:39:09,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:09,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696711423] [2020-09-15 13:39:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:09,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696711423] [2020-09-15 13:39:09,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:09,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 13:39:09,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1224087160] [2020-09-15 13:39:09,954 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:09,956 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:09,960 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-09-15 13:39:09,961 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:10,035 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:10,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 13:39:10,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:10,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 13:39:10,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:10,037 INFO L87 Difference]: Start difference. First operand 575 states and 1484 transitions. Second operand 3 states. [2020-09-15 13:39:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:10,060 INFO L93 Difference]: Finished difference Result 304 states and 670 transitions. [2020-09-15 13:39:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 13:39:10,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-15 13:39:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:10,069 INFO L225 Difference]: With dead ends: 304 [2020-09-15 13:39:10,069 INFO L226 Difference]: Without dead ends: 304 [2020-09-15 13:39:10,070 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 13:39:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-15 13:39:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2020-09-15 13:39:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-09-15 13:39:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 643 transitions. [2020-09-15 13:39:10,081 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 643 transitions. Word has length 16 [2020-09-15 13:39:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:10,081 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 643 transitions. [2020-09-15 13:39:10,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 13:39:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 643 transitions. [2020-09-15 13:39:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-15 13:39:10,083 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:10,083 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:10,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-15 13:39:10,083 INFO L427 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:10,084 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-09-15 13:39:10,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:10,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609882934] [2020-09-15 13:39:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:10,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609882934] [2020-09-15 13:39:10,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:10,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-15 13:39:10,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739086494] [2020-09-15 13:39:10,206 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:10,209 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:10,213 INFO L274 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-09-15 13:39:10,213 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:10,297 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6503#(< 0 (+ |t1Thread1of1ForFork0_inc_top_#t~post30| 1)), 6504#(< 0 (+ ~top~0 1))] [2020-09-15 13:39:10,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-15 13:39:10,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:10,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-15 13:39:10,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-15 13:39:10,298 INFO L87 Difference]: Start difference. First operand 294 states and 643 transitions. Second operand 7 states. [2020-09-15 13:39:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:10,421 INFO L93 Difference]: Finished difference Result 415 states and 890 transitions. [2020-09-15 13:39:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-15 13:39:10,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-09-15 13:39:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:10,426 INFO L225 Difference]: With dead ends: 415 [2020-09-15 13:39:10,426 INFO L226 Difference]: Without dead ends: 415 [2020-09-15 13:39:10,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-15 13:39:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-09-15 13:39:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2020-09-15 13:39:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-09-15 13:39:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 723 transitions. [2020-09-15 13:39:10,442 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 723 transitions. Word has length 17 [2020-09-15 13:39:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:10,444 INFO L479 AbstractCegarLoop]: Abstraction has 325 states and 723 transitions. [2020-09-15 13:39:10,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-15 13:39:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 723 transitions. [2020-09-15 13:39:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-15 13:39:10,446 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:10,446 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-09-15 13:39:10,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-15 13:39:10,447 INFO L427 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-09-15 13:39:10,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:10,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725707429] [2020-09-15 13:39:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:10,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725707429] [2020-09-15 13:39:10,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287126821] [2020-09-15 13:39:10,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:10,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-15 13:39:10,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-15 13:39:10,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-15 13:39:10,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:10,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-15 13:39:10,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-09-15 13:39:10,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805584807] [2020-09-15 13:39:10,710 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:10,713 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:10,717 INFO L274 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-09-15 13:39:10,717 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:10,718 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:10,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-15 13:39:10,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:10,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-15 13:39:10,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-15 13:39:10,719 INFO L87 Difference]: Start difference. First operand 325 states and 723 transitions. Second operand 9 states. [2020-09-15 13:39:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:10,828 INFO L93 Difference]: Finished difference Result 582 states and 1263 transitions. [2020-09-15 13:39:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-15 13:39:10,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-15 13:39:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:10,833 INFO L225 Difference]: With dead ends: 582 [2020-09-15 13:39:10,834 INFO L226 Difference]: Without dead ends: 582 [2020-09-15 13:39:10,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:39:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-09-15 13:39:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2020-09-15 13:39:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-09-15 13:39:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 931 transitions. [2020-09-15 13:39:10,850 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 931 transitions. Word has length 20 [2020-09-15 13:39:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:10,850 INFO L479 AbstractCegarLoop]: Abstraction has 416 states and 931 transitions. [2020-09-15 13:39:10,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-15 13:39:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 931 transitions. [2020-09-15 13:39:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-15 13:39:10,851 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:10,852 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] [2020-09-15 13:39:11,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:11,067 INFO L427 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-09-15 13:39:11,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:11,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375800101] [2020-09-15 13:39:11,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:11,427 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375800101] [2020-09-15 13:39:11,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:11,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-15 13:39:11,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238274215] [2020-09-15 13:39:11,428 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:11,431 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:11,437 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-09-15 13:39:11,438 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:11,472 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:11,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-15 13:39:11,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:11,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-15 13:39:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-15 13:39:11,474 INFO L87 Difference]: Start difference. First operand 416 states and 931 transitions. Second operand 9 states. [2020-09-15 13:39:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:11,789 INFO L93 Difference]: Finished difference Result 635 states and 1377 transitions. [2020-09-15 13:39:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 13:39:11,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-15 13:39:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:11,793 INFO L225 Difference]: With dead ends: 635 [2020-09-15 13:39:11,793 INFO L226 Difference]: Without dead ends: 573 [2020-09-15 13:39:11,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-15 13:39:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-09-15 13:39:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 442. [2020-09-15 13:39:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-09-15 13:39:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 986 transitions. [2020-09-15 13:39:11,809 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 986 transitions. Word has length 21 [2020-09-15 13:39:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:11,810 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 986 transitions. [2020-09-15 13:39:11,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-15 13:39:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 986 transitions. [2020-09-15 13:39:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-15 13:39:11,811 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:11,811 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:11,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-15 13:39:11,812 INFO L427 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:11,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-09-15 13:39:11,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:11,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558824617] [2020-09-15 13:39:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:11,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558824617] [2020-09-15 13:39:11,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293655123] [2020-09-15 13:39:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:12,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-15 13:39:12,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-15 13:39:12,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-15 13:39:12,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-09-15 13:39:12,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857959666] [2020-09-15 13:39:12,085 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:12,089 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:12,096 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-09-15 13:39:12,096 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:12,155 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:12,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-15 13:39:12,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-15 13:39:12,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 13:39:12,157 INFO L87 Difference]: Start difference. First operand 442 states and 986 transitions. Second operand 6 states. [2020-09-15 13:39:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:12,245 INFO L93 Difference]: Finished difference Result 600 states and 1292 transitions. [2020-09-15 13:39:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-15 13:39:12,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-15 13:39:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:12,250 INFO L225 Difference]: With dead ends: 600 [2020-09-15 13:39:12,250 INFO L226 Difference]: Without dead ends: 590 [2020-09-15 13:39:12,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-15 13:39:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-15 13:39:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2020-09-15 13:39:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-09-15 13:39:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1103 transitions. [2020-09-15 13:39:12,266 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1103 transitions. Word has length 24 [2020-09-15 13:39:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:12,267 INFO L479 AbstractCegarLoop]: Abstraction has 500 states and 1103 transitions. [2020-09-15 13:39:12,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-15 13:39:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1103 transitions. [2020-09-15 13:39:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-15 13:39:12,269 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:12,269 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-09-15 13:39:12,484 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:12,485 INFO L427 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-09-15 13:39:12,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:12,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642549389] [2020-09-15 13:39:12,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:12,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642549389] [2020-09-15 13:39:12,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992185839] [2020-09-15 13:39:12,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:12,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-15 13:39:12,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-15 13:39:12,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-15 13:39:12,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:12,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-15 13:39:12,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-09-15 13:39:12,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1265671047] [2020-09-15 13:39:12,806 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:12,814 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:12,823 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-09-15 13:39:12,823 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:12,824 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:12,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-15 13:39:12,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:12,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-15 13:39:12,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-15 13:39:12,825 INFO L87 Difference]: Start difference. First operand 500 states and 1103 transitions. Second operand 11 states. [2020-09-15 13:39:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:13,019 INFO L93 Difference]: Finished difference Result 839 states and 1799 transitions. [2020-09-15 13:39:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:39:13,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-09-15 13:39:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:13,030 INFO L225 Difference]: With dead ends: 839 [2020-09-15 13:39:13,030 INFO L226 Difference]: Without dead ends: 839 [2020-09-15 13:39:13,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-15 13:39:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-09-15 13:39:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 591. [2020-09-15 13:39:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-15 13:39:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1311 transitions. [2020-09-15 13:39:13,051 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1311 transitions. Word has length 27 [2020-09-15 13:39:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:13,052 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1311 transitions. [2020-09-15 13:39:13,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-15 13:39:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1311 transitions. [2020-09-15 13:39:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-15 13:39:13,054 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:13,055 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:13,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:13,268 INFO L427 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-09-15 13:39:13,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:13,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622791118] [2020-09-15 13:39:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-15 13:39:13,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622791118] [2020-09-15 13:39:13,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 13:39:13,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-15 13:39:13,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815746487] [2020-09-15 13:39:13,836 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:13,840 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:13,849 INFO L274 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-09-15 13:39:13,849 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:13,939 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14408#(and (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4))) (= |~#arr~0.offset| 0) (<= (select (select |#memory_int| |~#arr~0.base|) (* |t1Thread1of1ForFork0_inc_top_#t~post30| 4)) 399)), 14409#(and (<= (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4)) 399) (<= 0 (select (select |#memory_int| |~#arr~0.base|) (* ~top~0 4))) (= |~#arr~0.offset| 0))] [2020-09-15 13:39:13,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-15 13:39:13,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-15 13:39:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-09-15 13:39:13,941 INFO L87 Difference]: Start difference. First operand 591 states and 1311 transitions. Second operand 17 states. [2020-09-15 13:39:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:16,221 INFO L93 Difference]: Finished difference Result 946 states and 2054 transitions. [2020-09-15 13:39:16,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-15 13:39:16,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-09-15 13:39:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:16,232 INFO L225 Difference]: With dead ends: 946 [2020-09-15 13:39:16,232 INFO L226 Difference]: Without dead ends: 906 [2020-09-15 13:39:16,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2020-09-15 13:39:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-15 13:39:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 605. [2020-09-15 13:39:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-09-15 13:39:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1354 transitions. [2020-09-15 13:39:16,254 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1354 transitions. Word has length 28 [2020-09-15 13:39:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:16,255 INFO L479 AbstractCegarLoop]: Abstraction has 605 states and 1354 transitions. [2020-09-15 13:39:16,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-15 13:39:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1354 transitions. [2020-09-15 13:39:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-15 13:39:16,257 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:16,257 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:16,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-15 13:39:16,257 INFO L427 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-09-15 13:39:16,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:16,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755201628] [2020-09-15 13:39:16,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-15 13:39:16,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755201628] [2020-09-15 13:39:16,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401507647] [2020-09-15 13:39:16,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:16,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-15 13:39:16,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-15 13:39:16,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-15 13:39:16,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-15 13:39:16,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-15 13:39:16,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-15 13:39:16,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [257149241] [2020-09-15 13:39:16,627 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:16,634 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:16,652 INFO L274 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-09-15 13:39:16,653 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:16,713 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:16,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-15 13:39:16,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-15 13:39:16,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-15 13:39:16,715 INFO L87 Difference]: Start difference. First operand 605 states and 1354 transitions. Second operand 10 states. [2020-09-15 13:39:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:16,897 INFO L93 Difference]: Finished difference Result 907 states and 1949 transitions. [2020-09-15 13:39:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-15 13:39:16,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-15 13:39:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:16,904 INFO L225 Difference]: With dead ends: 907 [2020-09-15 13:39:16,904 INFO L226 Difference]: Without dead ends: 907 [2020-09-15 13:39:16,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-09-15 13:39:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-09-15 13:39:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 651. [2020-09-15 13:39:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2020-09-15 13:39:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1483 transitions. [2020-09-15 13:39:16,930 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1483 transitions. Word has length 31 [2020-09-15 13:39:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:16,930 INFO L479 AbstractCegarLoop]: Abstraction has 651 states and 1483 transitions. [2020-09-15 13:39:16,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-15 13:39:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1483 transitions. [2020-09-15 13:39:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-15 13:39:16,932 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:16,933 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-09-15 13:39:17,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-15 13:39:17,148 INFO L427 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-09-15 13:39:17,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:17,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133061151] [2020-09-15 13:39:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:17,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133061151] [2020-09-15 13:39:17,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967277226] [2020-09-15 13:39:17,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:17,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-15 13:39:17,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-15 13:39:17,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-15 13:39:17,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-15 13:39:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-09-15 13:39:17,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219776626] [2020-09-15 13:39:17,509 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-15 13:39:17,518 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-15 13:39:17,528 INFO L274 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-09-15 13:39:17,529 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-15 13:39:17,529 INFO L399 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-15 13:39:17,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-15 13:39:17,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 13:39:17,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-15 13:39:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-09-15 13:39:17,531 INFO L87 Difference]: Start difference. First operand 651 states and 1483 transitions. Second operand 13 states. [2020-09-15 13:39:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 13:39:17,710 INFO L93 Difference]: Finished difference Result 1005 states and 2204 transitions. [2020-09-15 13:39:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 13:39:17,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-09-15 13:39:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 13:39:17,717 INFO L225 Difference]: With dead ends: 1005 [2020-09-15 13:39:17,717 INFO L226 Difference]: Without dead ends: 1005 [2020-09-15 13:39:17,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2020-09-15 13:39:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2020-09-15 13:39:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 742. [2020-09-15 13:39:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2020-09-15 13:39:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1691 transitions. [2020-09-15 13:39:17,741 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1691 transitions. Word has length 34 [2020-09-15 13:39:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 13:39:17,742 INFO L479 AbstractCegarLoop]: Abstraction has 742 states and 1691 transitions. [2020-09-15 13:39:17,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-15 13:39:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1691 transitions. [2020-09-15 13:39:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-15 13:39:17,745 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 13:39:17,745 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 13:39:17,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:17,958 INFO L427 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-15 13:39:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 13:39:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-09-15 13:39:17,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 13:39:17,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170959790] [2020-09-15 13:39:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 13:39:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 13:39:18,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170959790] [2020-09-15 13:39:18,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528244873] [2020-09-15 13:39:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 13:39:18,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2020-09-15 13:39:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-15 13:39:19,073 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 13:39:19,074 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 260 [2020-09-15 13:39:19,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-15 13:39:19,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-15 13:39:19,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-09-15 13:39:19,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-09-15 13:39:19,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-09-15 13:39:19,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-15 13:39:19,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-15 13:39:19,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-09-15 13:39:19,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-15 13:39:19,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-09-15 13:39:19,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-15 13:39:19,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-09-15 13:39:19,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-09-15 13:39:19,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-09-15 13:39:19,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-09-15 13:39:19,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-15 13:39:19,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-09-15 13:39:19,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-15 13:39:19,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-15 13:39:19,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-15 13:39:19,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-15 13:39:19,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-15 13:39:19,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-15 13:39:19,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,140 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-15 13:39:19,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-15 13:39:19,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-15 13:39:19,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-15 13:39:19,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-15 13:39:19,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,200 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,219 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-15 13:39:19,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-15 13:39:19,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-15 13:39:19,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-15 13:39:19,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-15 13:39:19,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-15 13:39:19,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-15 13:39:19,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-15 13:39:19,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-15 13:39:19,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-15 13:39:19,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-15 13:39:19,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,254 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,259 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,265 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-15 13:39:19,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,278 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,284 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,284 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,291 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,297 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,313 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,315 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,327 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,334 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-15 13:39:19,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-15 13:39:19,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-15 13:39:19,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-15 13:39:19,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-15 13:39:19,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-15 13:39:19,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-15 13:39:19,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-15 13:39:19,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,371 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,377 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-15 13:39:19,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-15 13:39:19,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-15 13:39:19,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-15 13:39:19,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-15 13:39:19,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-15 13:39:19,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-15 13:39:19,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-15 13:39:19,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-15 13:39:19,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,393 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-15 13:39:19,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-15 13:39:19,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-15 13:39:19,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-15 13:39:19,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-15 13:39:19,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-15 13:39:19,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-15 13:39:19,398 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-15 13:39:19,405 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-15 13:39:20,124 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-09-15 13:39:20,125 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-09-15 13:39:20,139 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-09-15 13:39:20,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-15 13:39:20,342 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: need array sort at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.binaryEquality(SmtUtils.java:663) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatusViaSolver(ArrayIndexEqualityManager.java:150) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.checkEqualityStatus(ArrayIndexEqualityManager.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:617) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:409) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:295) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:602) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:515) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:239) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:309) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:105) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-09-15 13:39:20,348 INFO L168 Benchmark]: Toolchain (without parser) took 18568.00 ms. Allocated memory was 141.0 MB in the beginning and 397.9 MB in the end (delta: 256.9 MB). Free memory was 100.3 MB in the beginning and 107.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,349 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1010.02 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 133.4 MB in the end (delta: -33.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.35 ms. Allocated memory is still 203.9 MB. Free memory was 133.4 MB in the beginning and 130.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,351 INFO L168 Benchmark]: Boogie Preprocessor took 43.01 ms. Allocated memory is still 203.9 MB. Free memory was 130.8 MB in the beginning and 128.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,352 INFO L168 Benchmark]: RCFGBuilder took 676.93 ms. Allocated memory is still 203.9 MB. Free memory was 128.9 MB in the beginning and 96.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,352 INFO L168 Benchmark]: TraceAbstraction took 16734.27 ms. Allocated memory was 203.9 MB in the beginning and 397.9 MB in the end (delta: 194.0 MB). Free memory was 96.0 MB in the beginning and 107.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2020-09-15 13:39:20,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1010.02 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 99.7 MB in the beginning and 133.4 MB in the end (delta: -33.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.35 ms. Allocated memory is still 203.9 MB. Free memory was 133.4 MB in the beginning and 130.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.01 ms. Allocated memory is still 203.9 MB. Free memory was 130.8 MB in the beginning and 128.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 676.93 ms. Allocated memory is still 203.9 MB. Free memory was 128.9 MB in the beginning and 96.6 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16734.27 ms. Allocated memory was 203.9 MB in the beginning and 397.9 MB in the end (delta: 194.0 MB). Free memory was 96.0 MB in the beginning and 107.6 MB in the end (delta: -11.6 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 133 ProgramPointsBefore, 40 ProgramPointsAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 5744 CoEnabledTransitionPairs, 7 FixpointIterations, 26 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 5 ChoiceCompositions, 3038 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7699 CheckedPairsTotal, 118 TotalNumberOfCompositions - ExceptionOrErrorResult: UnsupportedOperationException: need array sort de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: need array sort: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.arrayEquality(SmtUtils.java:760) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...