/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-bf4350c [2020-09-17 14:53:09,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-17 14:53:09,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-17 14:53:09,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-17 14:53:09,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-17 14:53:09,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-17 14:53:09,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-17 14:53:09,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-17 14:53:09,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-17 14:53:09,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-17 14:53:09,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-17 14:53:09,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-17 14:53:09,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-17 14:53:09,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-17 14:53:09,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-17 14:53:09,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-17 14:53:09,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-17 14:53:09,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-17 14:53:09,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-17 14:53:09,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-17 14:53:09,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-17 14:53:09,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-17 14:53:09,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-17 14:53:09,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-17 14:53:09,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-17 14:53:09,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-17 14:53:09,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-17 14:53:09,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-17 14:53:09,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-17 14:53:09,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-17 14:53:09,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-17 14:53:09,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-17 14:53:09,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-17 14:53:09,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-17 14:53:09,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-17 14:53:09,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-17 14:53:10,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-17 14:53:10,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-17 14:53:10,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-17 14:53:10,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-17 14:53:10,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-17 14:53:10,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-09-17 14:53:10,061 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-17 14:53:10,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-17 14:53:10,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-17 14:53:10,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-17 14:53:10,064 INFO L138 SettingsManager]: * Use SBE=true [2020-09-17 14:53:10,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-17 14:53:10,065 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-17 14:53:10,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-17 14:53:10,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-17 14:53:10,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-17 14:53:10,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-17 14:53:10,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-17 14:53:10,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-17 14:53:10,068 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-17 14:53:10,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-17 14:53:10,068 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-17 14:53:10,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-17 14:53:10,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-17 14:53:10,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-17 14:53:10,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-17 14:53:10,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-17 14:53:10,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-17 14:53:10,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-17 14:53:10,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-17 14:53:10,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-17 14:53:10,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-17 14:53:10,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-17 14:53:10,071 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-09-17 14:53:10,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-17 14:53:10,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-17 14:53:10,072 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-09-17 14:53:10,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-17 14:53:10,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-17 14:53:10,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-17 14:53:10,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-17 14:53:10,561 INFO L275 PluginConnector]: CDTParser initialized [2020-09-17 14:53:10,562 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-17 14:53:10,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5b7a8eb/d4dbe1e5056240e4a000ec5d7ecea0d5/FLAG35875f19e [2020-09-17 14:53:11,332 INFO L306 CDTParser]: Found 1 translation units. [2020-09-17 14:53:11,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-09-17 14:53:11,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5b7a8eb/d4dbe1e5056240e4a000ec5d7ecea0d5/FLAG35875f19e [2020-09-17 14:53:11,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be5b7a8eb/d4dbe1e5056240e4a000ec5d7ecea0d5 [2020-09-17 14:53:11,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-17 14:53:11,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-17 14:53:11,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-17 14:53:11,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-17 14:53:11,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-17 14:53:11,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 02:53:11" (1/1) ... [2020-09-17 14:53:11,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67abc2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:11, skipping insertion in model container [2020-09-17 14:53:11,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 02:53:11" (1/1) ... [2020-09-17 14:53:11,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-17 14:53:11,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-17 14:53:12,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 14:53:12,562 INFO L203 MainTranslator]: Completed pre-run [2020-09-17 14:53:12,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-17 14:53:12,869 INFO L208 MainTranslator]: Completed translation [2020-09-17 14:53:12,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12 WrapperNode [2020-09-17 14:53:12,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-17 14:53:12,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-17 14:53:12,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-17 14:53:12,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-17 14:53:12,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-17 14:53:12,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-17 14:53:12,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-17 14:53:12,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-17 14:53:12,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:12,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:13,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:13,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... [2020-09-17 14:53:13,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-17 14:53:13,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-17 14:53:13,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-17 14:53:13,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-17 14:53:13,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-17 14:53:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-09-17 14:53:13,116 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-09-17 14:53:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-09-17 14:53:13,116 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-09-17 14:53:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-17 14:53:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-17 14:53:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-17 14:53:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-17 14:53:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-09-17 14:53:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-17 14:53:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-17 14:53:13,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-17 14:53:13,121 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-17 14:53:13,678 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-17 14:53:13,678 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-09-17 14:53:13,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 02:53:13 BoogieIcfgContainer [2020-09-17 14:53:13,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-17 14:53:13,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-17 14:53:13,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-17 14:53:13,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-17 14:53:13,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 02:53:11" (1/3) ... [2020-09-17 14:53:13,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1694a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 02:53:13, skipping insertion in model container [2020-09-17 14:53:13,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 02:53:12" (2/3) ... [2020-09-17 14:53:13,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1694a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 02:53:13, skipping insertion in model container [2020-09-17 14:53:13,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 02:53:13" (3/3) ... [2020-09-17 14:53:13,693 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-09-17 14:53:13,706 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-17 14:53:13,706 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-17 14:53:13,718 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-09-17 14:53:13,719 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-17 14:53:13,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,762 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,763 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,764 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,765 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,765 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,782 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,783 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,783 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,784 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,785 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,785 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,786 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,787 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,787 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,788 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,789 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,790 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,790 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,791 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,791 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,792 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,792 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,793 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,794 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,794 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,795 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,796 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,796 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,797 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,798 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,799 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,800 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,800 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,801 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,801 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,802 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,802 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,803 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,804 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,805 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,806 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,807 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,807 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,808 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,808 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,809 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,814 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,814 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,814 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,814 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,815 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,815 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,815 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,816 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,816 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,816 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,816 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,816 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,817 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,817 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,817 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,817 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,818 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,818 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,818 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,818 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,819 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,819 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,819 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,828 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,828 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,828 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,829 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,829 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,830 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,830 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,831 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,831 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,832 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-17 14:53:13,868 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-17 14:53:13,901 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-17 14:53:13,901 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-17 14:53:13,901 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-17 14:53:13,901 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-09-17 14:53:13,901 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-17 14:53:13,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-17 14:53:13,903 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-17 14:53:13,903 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-17 14:53:13,934 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:13,937 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:14,070 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-17 14:53:14,070 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 14:53:14,081 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-17 14:53:14,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-09-17 14:53:14,156 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-09-17 14:53:14,164 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-17 14:53:14,166 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-17 14:53:14,176 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5744 [2020-09-17 14:53:14,177 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-17 14:53:15,949 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-09-17 14:53:17,279 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-09-17 14:53:17,565 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-09-17 14:53:17,974 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-09-17 14:53:18,220 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-09-17 14:53:18,234 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7699 [2020-09-17 14:53:18,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2020-09-17 14:53:18,239 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-09-17 14:53:18,266 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-09-17 14:53:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-09-17 14:53:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-09-17 14:53:18,277 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:18,279 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-09-17 14:53:18,279 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-17 14:53:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-09-17 14:53:18,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:18,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287245790] [2020-09-17 14:53:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:18,628 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-17 14:53:18,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287245790] [2020-09-17 14:53:18,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:18,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 14:53:18,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067879474] [2020-09-17 14:53:18,635 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:18,641 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:18,660 INFO L274 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-09-17 14:53:18,661 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:18,663 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:18,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:18,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:18,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:18,688 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-09-17 14:53:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:18,802 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-09-17 14:53:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:18,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-09-17 14:53:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:18,828 INFO L225 Difference]: With dead ends: 504 [2020-09-17 14:53:18,828 INFO L226 Difference]: Without dead ends: 460 [2020-09-17 14:53:18,830 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-17 14:53:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-09-17 14:53:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-09-17 14:53:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-09-17 14:53:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-09-17 14:53:18,974 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-09-17 14:53:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:18,975 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-09-17 14:53:18,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-09-17 14:53:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-09-17 14:53:18,981 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:18,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:18,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-17 14:53:18,982 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-17 14:53:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-09-17 14:53:18,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:18,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547741344] [2020-09-17 14:53:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:19,115 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-17 14:53:19,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547741344] [2020-09-17 14:53:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-17 14:53:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874875540] [2020-09-17 14:53:19,117 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:19,118 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:19,119 INFO L274 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-09-17 14:53:19,120 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:19,120 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:19,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:19,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:19,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:19,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:19,123 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-09-17 14:53:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:19,143 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-09-17 14:53:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:19,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-09-17 14:53:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:19,148 INFO L225 Difference]: With dead ends: 464 [2020-09-17 14:53:19,148 INFO L226 Difference]: Without dead ends: 464 [2020-09-17 14:53:19,149 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-17 14:53:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-09-17 14:53:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-09-17 14:53:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-09-17 14:53:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-09-17 14:53:19,178 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-09-17 14:53:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:19,178 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-09-17 14:53:19,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-09-17 14:53:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-17 14:53:19,180 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:19,180 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:19,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-17 14:53:19,181 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-17 14:53:19,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:19,181 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-09-17 14:53:19,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:19,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949168471] [2020-09-17 14:53:19,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:19,331 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-17 14:53:19,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949168471] [2020-09-17 14:53:19,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527833512] [2020-09-17 14:53:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:19,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-09-17 14:53:19,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:19,489 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-17 14:53:19,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:19,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-09-17 14:53:19,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118749555] [2020-09-17 14:53:19,491 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:19,494 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:19,497 INFO L274 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-09-17 14:53:19,497 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:19,498 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:19,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 14:53:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 14:53:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-17 14:53:19,500 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 7 states. [2020-09-17 14:53:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:19,696 INFO L93 Difference]: Finished difference Result 866 states and 2152 transitions. [2020-09-17 14:53:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-17 14:53:19,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-09-17 14:53:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:19,705 INFO L225 Difference]: With dead ends: 866 [2020-09-17 14:53:19,705 INFO L226 Difference]: Without dead ends: 851 [2020-09-17 14:53:19,705 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-17 14:53:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2020-09-17 14:53:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 575. [2020-09-17 14:53:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-09-17 14:53:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1484 transitions. [2020-09-17 14:53:19,734 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1484 transitions. Word has length 13 [2020-09-17 14:53:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:19,734 INFO L479 AbstractCegarLoop]: Abstraction has 575 states and 1484 transitions. [2020-09-17 14:53:19,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 14:53:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1484 transitions. [2020-09-17 14:53:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-17 14:53:19,737 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:19,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:19,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-17 14:53:19,951 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-17 14:53:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-09-17 14:53:19,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:19,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5007782] [2020-09-17 14:53:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:20,064 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-17 14:53:20,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5007782] [2020-09-17 14:53:20,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:20,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-17 14:53:20,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791183744] [2020-09-17 14:53:20,066 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:20,069 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:20,073 INFO L274 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-09-17 14:53:20,073 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:20,124 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:20,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-17 14:53:20,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:20,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-17 14:53:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-17 14:53:20,126 INFO L87 Difference]: Start difference. First operand 575 states and 1484 transitions. Second operand 3 states. [2020-09-17 14:53:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:20,153 INFO L93 Difference]: Finished difference Result 304 states and 670 transitions. [2020-09-17 14:53:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-17 14:53:20,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-17 14:53:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:20,156 INFO L225 Difference]: With dead ends: 304 [2020-09-17 14:53:20,157 INFO L226 Difference]: Without dead ends: 304 [2020-09-17 14:53:20,157 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-17 14:53:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-09-17 14:53:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 294. [2020-09-17 14:53:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-09-17 14:53:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 643 transitions. [2020-09-17 14:53:20,168 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 643 transitions. Word has length 16 [2020-09-17 14:53:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:20,168 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 643 transitions. [2020-09-17 14:53:20,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-17 14:53:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 643 transitions. [2020-09-17 14:53:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-17 14:53:20,170 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:20,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-17 14:53:20,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-17 14:53:20,171 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-17 14:53:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-09-17 14:53:20,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:20,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767422165] [2020-09-17 14:53:20,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:20,300 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-17 14:53:20,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767422165] [2020-09-17 14:53:20,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:20,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-17 14:53:20,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1166949380] [2020-09-17 14:53:20,302 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:20,305 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:20,310 INFO L274 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-09-17 14:53:20,310 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:20,372 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [6503#(< 0 (+ |t1Thread1of1ForFork0_inc_top_#t~post30| 1)), 6504#(< 0 (+ ~top~0 1))] [2020-09-17 14:53:20,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-17 14:53:20,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-17 14:53:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-17 14:53:20,374 INFO L87 Difference]: Start difference. First operand 294 states and 643 transitions. Second operand 7 states. [2020-09-17 14:53:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:20,484 INFO L93 Difference]: Finished difference Result 415 states and 890 transitions. [2020-09-17 14:53:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-17 14:53:20,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-09-17 14:53:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:20,491 INFO L225 Difference]: With dead ends: 415 [2020-09-17 14:53:20,491 INFO L226 Difference]: Without dead ends: 415 [2020-09-17 14:53:20,492 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-17 14:53:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-09-17 14:53:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 325. [2020-09-17 14:53:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2020-09-17 14:53:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 723 transitions. [2020-09-17 14:53:20,506 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 723 transitions. Word has length 17 [2020-09-17 14:53:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:20,508 INFO L479 AbstractCegarLoop]: Abstraction has 325 states and 723 transitions. [2020-09-17 14:53:20,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-17 14:53:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 723 transitions. [2020-09-17 14:53:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-17 14:53:20,511 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:20,511 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-09-17 14:53:20,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-17 14:53:20,511 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-17 14:53:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-09-17 14:53:20,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:20,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45210600] [2020-09-17 14:53:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:20,670 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-17 14:53:20,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45210600] [2020-09-17 14:53:20,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671679085] [2020-09-17 14:53:20,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-17 14:53:20,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-17 14:53:20,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:20,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-17 14:53:20,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:20,803 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-17 14:53:20,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:20,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-09-17 14:53:20,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1384009975] [2020-09-17 14:53:20,805 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:20,808 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:20,812 INFO L274 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-09-17 14:53:20,812 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:20,813 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:20,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-17 14:53:20,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-17 14:53:20,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-17 14:53:20,814 INFO L87 Difference]: Start difference. First operand 325 states and 723 transitions. Second operand 9 states. [2020-09-17 14:53:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:20,926 INFO L93 Difference]: Finished difference Result 582 states and 1263 transitions. [2020-09-17 14:53:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-17 14:53:20,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-17 14:53:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:20,931 INFO L225 Difference]: With dead ends: 582 [2020-09-17 14:53:20,931 INFO L226 Difference]: Without dead ends: 582 [2020-09-17 14:53:20,932 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-17 14:53:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2020-09-17 14:53:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 416. [2020-09-17 14:53:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-09-17 14:53:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 931 transitions. [2020-09-17 14:53:20,948 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 931 transitions. Word has length 20 [2020-09-17 14:53:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:20,948 INFO L479 AbstractCegarLoop]: Abstraction has 416 states and 931 transitions. [2020-09-17 14:53:20,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-17 14:53:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 931 transitions. [2020-09-17 14:53:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-17 14:53:20,950 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:20,950 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-17 14:53:21,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:21,166 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-17 14:53:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-09-17 14:53:21,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:21,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144968213] [2020-09-17 14:53:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:21,562 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-17 14:53:21,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144968213] [2020-09-17 14:53:21,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:21,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-17 14:53:21,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548202309] [2020-09-17 14:53:21,564 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:21,569 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:21,575 INFO L274 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-09-17 14:53:21,576 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:21,599 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:21,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-17 14:53:21,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-17 14:53:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-17 14:53:21,600 INFO L87 Difference]: Start difference. First operand 416 states and 931 transitions. Second operand 9 states. [2020-09-17 14:53:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:21,890 INFO L93 Difference]: Finished difference Result 635 states and 1377 transitions. [2020-09-17 14:53:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-17 14:53:21,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-17 14:53:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:21,895 INFO L225 Difference]: With dead ends: 635 [2020-09-17 14:53:21,896 INFO L226 Difference]: Without dead ends: 573 [2020-09-17 14:53:21,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-17 14:53:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2020-09-17 14:53:21,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 442. [2020-09-17 14:53:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-09-17 14:53:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 986 transitions. [2020-09-17 14:53:21,911 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 986 transitions. Word has length 21 [2020-09-17 14:53:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:21,912 INFO L479 AbstractCegarLoop]: Abstraction has 442 states and 986 transitions. [2020-09-17 14:53:21,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-17 14:53:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 986 transitions. [2020-09-17 14:53:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-17 14:53:21,913 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:21,913 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-17 14:53:21,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-17 14:53:21,914 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-17 14:53:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-09-17 14:53:21,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:21,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259985223] [2020-09-17 14:53:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:22,046 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-17 14:53:22,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259985223] [2020-09-17 14:53:22,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348040669] [2020-09-17 14:53:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:22,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-17 14:53:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:22,156 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-17 14:53:22,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-09-17 14:53:22,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-09-17 14:53:22,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537124263] [2020-09-17 14:53:22,157 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:22,161 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:22,168 INFO L274 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-09-17 14:53:22,168 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:22,203 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:22,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-17 14:53:22,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:22,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-17 14:53:22,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-17 14:53:22,205 INFO L87 Difference]: Start difference. First operand 442 states and 986 transitions. Second operand 6 states. [2020-09-17 14:53:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:22,285 INFO L93 Difference]: Finished difference Result 600 states and 1292 transitions. [2020-09-17 14:53:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-17 14:53:22,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-17 14:53:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:22,289 INFO L225 Difference]: With dead ends: 600 [2020-09-17 14:53:22,289 INFO L226 Difference]: Without dead ends: 590 [2020-09-17 14:53:22,290 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-17 14:53:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2020-09-17 14:53:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2020-09-17 14:53:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-09-17 14:53:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1103 transitions. [2020-09-17 14:53:22,307 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1103 transitions. Word has length 24 [2020-09-17 14:53:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:22,308 INFO L479 AbstractCegarLoop]: Abstraction has 500 states and 1103 transitions. [2020-09-17 14:53:22,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-17 14:53:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1103 transitions. [2020-09-17 14:53:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-17 14:53:22,309 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:22,309 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-09-17 14:53:22,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:22,523 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-17 14:53:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-09-17 14:53:22,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:22,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747245886] [2020-09-17 14:53:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:22,662 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-17 14:53:22,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747245886] [2020-09-17 14:53:22,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146995059] [2020-09-17 14:53:22,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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-17 14:53:22,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-17 14:53:22,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:22,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-17 14:53:22,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:22,878 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-17 14:53:22,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:22,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-09-17 14:53:22,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057643704] [2020-09-17 14:53:22,880 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:22,889 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:22,959 INFO L274 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-09-17 14:53:22,960 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:22,960 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:22,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-17 14:53:22,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:22,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-17 14:53:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-17 14:53:22,961 INFO L87 Difference]: Start difference. First operand 500 states and 1103 transitions. Second operand 11 states. [2020-09-17 14:53:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:23,126 INFO L93 Difference]: Finished difference Result 839 states and 1799 transitions. [2020-09-17 14:53:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 14:53:23,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-09-17 14:53:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:23,136 INFO L225 Difference]: With dead ends: 839 [2020-09-17 14:53:23,136 INFO L226 Difference]: Without dead ends: 839 [2020-09-17 14:53:23,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-17 14:53:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2020-09-17 14:53:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 591. [2020-09-17 14:53:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-17 14:53:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1311 transitions. [2020-09-17 14:53:23,157 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1311 transitions. Word has length 27 [2020-09-17 14:53:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:23,157 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1311 transitions. [2020-09-17 14:53:23,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-17 14:53:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1311 transitions. [2020-09-17 14:53:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-17 14:53:23,159 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:23,160 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-17 14:53:23,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:23,373 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-17 14:53:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-09-17 14:53:23,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:23,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967594613] [2020-09-17 14:53:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:23,824 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-17 14:53:23,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967594613] [2020-09-17 14:53:23,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-17 14:53:23,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-17 14:53:23,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248607895] [2020-09-17 14:53:23,826 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:23,831 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:23,839 INFO L274 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-09-17 14:53:23,840 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:23,920 INFO L409 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-17 14:53:23,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-17 14:53:23,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-17 14:53:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-09-17 14:53:23,921 INFO L87 Difference]: Start difference. First operand 591 states and 1311 transitions. Second operand 17 states. [2020-09-17 14:53:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:26,266 INFO L93 Difference]: Finished difference Result 946 states and 2054 transitions. [2020-09-17 14:53:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-17 14:53:26,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-09-17 14:53:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:26,273 INFO L225 Difference]: With dead ends: 946 [2020-09-17 14:53:26,273 INFO L226 Difference]: Without dead ends: 906 [2020-09-17 14:53:26,274 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-17 14:53:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-17 14:53:26,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 605. [2020-09-17 14:53:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2020-09-17 14:53:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1354 transitions. [2020-09-17 14:53:26,296 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1354 transitions. Word has length 28 [2020-09-17 14:53:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:26,297 INFO L479 AbstractCegarLoop]: Abstraction has 605 states and 1354 transitions. [2020-09-17 14:53:26,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-17 14:53:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1354 transitions. [2020-09-17 14:53:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-17 14:53:26,299 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:26,299 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-17 14:53:26,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-17 14:53:26,299 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-17 14:53:26,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-09-17 14:53:26,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:26,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884359763] [2020-09-17 14:53:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:26,470 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-17 14:53:26,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884359763] [2020-09-17 14:53:26,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303377871] [2020-09-17 14:53:26,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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-17 14:53:26,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-17 14:53:26,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:26,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-17 14:53:26,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:26,619 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-17 14:53:26,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:26,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-17 14:53:26,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [630387648] [2020-09-17 14:53:26,621 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:26,632 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:26,645 INFO L274 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-09-17 14:53:26,646 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:26,716 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:26,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-17 14:53:26,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-17 14:53:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-17 14:53:26,717 INFO L87 Difference]: Start difference. First operand 605 states and 1354 transitions. Second operand 10 states. [2020-09-17 14:53:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:26,875 INFO L93 Difference]: Finished difference Result 907 states and 1949 transitions. [2020-09-17 14:53:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-17 14:53:26,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-17 14:53:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:26,880 INFO L225 Difference]: With dead ends: 907 [2020-09-17 14:53:26,881 INFO L226 Difference]: Without dead ends: 907 [2020-09-17 14:53:26,881 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-17 14:53:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2020-09-17 14:53:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 651. [2020-09-17 14:53:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2020-09-17 14:53:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1483 transitions. [2020-09-17 14:53:26,902 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1483 transitions. Word has length 31 [2020-09-17 14:53:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:26,902 INFO L479 AbstractCegarLoop]: Abstraction has 651 states and 1483 transitions. [2020-09-17 14:53:26,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-17 14:53:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1483 transitions. [2020-09-17 14:53:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-17 14:53:26,904 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:26,904 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-09-17 14:53:27,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-17 14:53:27,118 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-17 14:53:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-09-17 14:53:27,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:27,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017116035] [2020-09-17 14:53:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:27,308 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-17 14:53:27,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017116035] [2020-09-17 14:53:27,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316573641] [2020-09-17 14:53:27,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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-17 14:53:27,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-17 14:53:27,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-17 14:53:27,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-17 14:53:27,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:27,469 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-17 14:53:27,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-17 14:53:27,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-09-17 14:53:27,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551846340] [2020-09-17 14:53:27,471 INFO L216 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-09-17 14:53:27,478 INFO L271 McrAutomatonBuilder]: Started intersection. [2020-09-17 14:53:27,491 INFO L274 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-09-17 14:53:27,492 INFO L299 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-09-17 14:53:27,492 INFO L409 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-09-17 14:53:27,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-17 14:53:27,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-17 14:53:27,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-17 14:53:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-09-17 14:53:27,494 INFO L87 Difference]: Start difference. First operand 651 states and 1483 transitions. Second operand 13 states. [2020-09-17 14:53:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-17 14:53:27,669 INFO L93 Difference]: Finished difference Result 1005 states and 2204 transitions. [2020-09-17 14:53:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-17 14:53:27,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-09-17 14:53:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-17 14:53:27,675 INFO L225 Difference]: With dead ends: 1005 [2020-09-17 14:53:27,675 INFO L226 Difference]: Without dead ends: 1005 [2020-09-17 14:53:27,675 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-17 14:53:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2020-09-17 14:53:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 742. [2020-09-17 14:53:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2020-09-17 14:53:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1691 transitions. [2020-09-17 14:53:27,695 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1691 transitions. Word has length 34 [2020-09-17 14:53:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-17 14:53:27,696 INFO L479 AbstractCegarLoop]: Abstraction has 742 states and 1691 transitions. [2020-09-17 14:53:27,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-17 14:53:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1691 transitions. [2020-09-17 14:53:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-17 14:53:27,697 INFO L414 BasicCegarLoop]: Found error trace [2020-09-17 14:53:27,698 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-17 14:53:27,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:27,911 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-17 14:53:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-17 14:53:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-09-17 14:53:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-17 14:53:27,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126202075] [2020-09-17 14:53:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-17 14:53:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:28,696 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-17 14:53:28,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126202075] [2020-09-17 14:53:28,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002250300] [2020-09-17 14:53:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-17 14:53:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-17 14:53:28,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2020-09-17 14:53:28,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-17 14:53:28,935 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-09-17 14:53:28,936 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-17 14:53:28,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-17 14:53:28,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:28,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:28,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:28,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:28,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-09-17 14:53:28,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:28,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:28,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:28,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-09-17 14:53:28,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:28,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-09-17 14:53:28,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:28,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-09-17 14:53:28,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-09-17 14:53:28,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-09-17 14:53:28,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-09-17 14:53:28,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-09-17 14:53:28,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-09-17 14:53:28,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-09-17 14:53:28,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-09-17 14:53:28,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-09-17 14:53:28,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:28,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:28,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-09-17 14:53:28,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,983 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:28,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:28,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:28,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:28,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:28,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:28,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:28,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:29,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:29,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:29,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:29,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,044 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,063 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-09-17 14:53:29,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-09-17 14:53:29,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-09-17 14:53:29,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:29,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:29,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:29,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:29,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:29,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:29,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:29,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:29,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,099 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:29,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,104 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,110 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-09-17 14:53:29,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,124 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,128 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,129 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,134 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,140 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,157 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:29,159 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,172 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:29,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,179 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:29,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:29,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:29,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:29,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:29,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:29,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:29,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:29,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,217 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:29,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,222 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-09-17 14:53:29,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-09-17 14:53:29,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-09-17 14:53:29,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-09-17 14:53:29,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-09-17 14:53:29,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-09-17 14:53:29,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-09-17 14:53:29,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-09-17 14:53:29,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-09-17 14:53:29,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,238 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-09-17 14:53:29,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-09-17 14:53:29,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-09-17 14:53:29,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-09-17 14:53:29,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-09-17 14:53:29,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-09-17 14:53:29,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-09-17 14:53:29,243 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-09-17 14:53:29,251 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-09-17 14:53:30,013 WARN L193 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-09-17 14:53:30,014 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-09-17 14:53:30,035 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-09-17 14:53:30,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-17 14:53:30,238 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-17 14:53:30,243 INFO L168 Benchmark]: Toolchain (without parser) took 18668.97 ms. Allocated memory was 147.3 MB in the beginning and 387.4 MB in the end (delta: 240.1 MB). Free memory was 102.0 MB in the beginning and 325.7 MB in the end (delta: -223.7 MB). Peak memory consumption was 252.0 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,244 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1286.51 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 137.2 MB in the end (delta: -36.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.45 ms. Allocated memory is still 206.0 MB. Free memory was 137.2 MB in the beginning and 134.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,246 INFO L168 Benchmark]: Boogie Preprocessor took 48.82 ms. Allocated memory is still 206.0 MB. Free memory was 134.5 MB in the beginning and 132.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,247 INFO L168 Benchmark]: RCFGBuilder took 668.05 ms. Allocated memory is still 206.0 MB. Free memory was 132.4 MB in the beginning and 100.0 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,248 INFO L168 Benchmark]: TraceAbstraction took 16556.62 ms. Allocated memory was 206.0 MB in the beginning and 387.4 MB in the end (delta: 181.4 MB). Free memory was 99.4 MB in the beginning and 325.7 MB in the end (delta: -226.3 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. [2020-09-17 14:53:30,252 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.21 ms. Allocated memory is still 147.3 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1286.51 ms. Allocated memory was 147.3 MB in the beginning and 206.0 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 137.2 MB in the end (delta: -36.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.45 ms. Allocated memory is still 206.0 MB. Free memory was 137.2 MB in the beginning and 134.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.82 ms. Allocated memory is still 206.0 MB. Free memory was 134.5 MB in the beginning and 132.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 668.05 ms. Allocated memory is still 206.0 MB. Free memory was 132.4 MB in the beginning and 100.0 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16556.62 ms. Allocated memory was 206.0 MB in the beginning and 387.4 MB in the end (delta: 181.4 MB). Free memory was 99.4 MB in the beginning and 325.7 MB in the end (delta: -226.3 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 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...