/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-c7e336b [2020-10-06 00:00:47,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:00:47,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:00:47,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:00:47,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:00:47,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:00:47,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:00:47,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:00:47,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:00:47,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:00:47,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:00:47,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:00:47,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:00:47,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:00:47,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:00:47,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:00:47,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:00:47,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:00:47,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:00:47,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:00:47,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:00:47,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:00:47,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:00:47,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:00:47,862 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:00:47,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:00:47,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:00:47,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:00:47,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:00:47,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:00:47,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:00:47,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:00:47,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:00:47,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:00:47,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:00:47,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:00:47,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:00:47,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:00:47,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:00:47,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:00:47,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:00:47,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:00:47,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:00:47,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:00:47,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:00:47,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:00:47,940 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:00:47,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:00:47,942 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:00:47,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:00:47,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:00:47,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:00:47,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:00:47,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:00:47,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:00:47,945 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:00:47,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:00:47,945 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:00:47,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:00:47,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:00:47,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:00:47,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:00:47,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:00:47,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:00:47,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:00:47,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:00:47,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:00:47,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:00:47,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:00:47,948 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:00:47,948 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:00:47,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:00:47,949 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:00:48,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:00:48,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:00:48,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:00:48,316 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:00:48,317 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:00:48,318 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-10-06 00:00:48,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3a675c0/40719baf380e41e3830be55ca3441cb2/FLAGa3456f858 [2020-10-06 00:00:48,983 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:00:48,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2020-10-06 00:00:49,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3a675c0/40719baf380e41e3830be55ca3441cb2/FLAGa3456f858 [2020-10-06 00:00:49,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd3a675c0/40719baf380e41e3830be55ca3441cb2 [2020-10-06 00:00:49,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:00:49,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:00:49,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:00:49,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:00:49,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:00:49,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:00:49" (1/1) ... [2020-10-06 00:00:49,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5588a755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:49, skipping insertion in model container [2020-10-06 00:00:49,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:00:49" (1/1) ... [2020-10-06 00:00:49,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:00:49,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:00:49,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:00:49,883 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:00:49,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:00:50,141 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:00:50,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50 WrapperNode [2020-10-06 00:00:50,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:00:50,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:00:50,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:00:50,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:00:50,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:00:50,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:00:50,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:00:50,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:00:50,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... [2020-10-06 00:00:50,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:00:50,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:00:50,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:00:50,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:00:50,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:00:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-10-06 00:00:50,344 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-10-06 00:00:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-10-06 00:00:50,344 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-10-06 00:00:50,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:00:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:00:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-06 00:00:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:00:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-10-06 00:00:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-06 00:00:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:00:50,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:00:50,348 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:00:50,853 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:00:50,854 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-06 00:00:50,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:00:50 BoogieIcfgContainer [2020-10-06 00:00:50,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:00:50,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:00:50,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:00:50,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:00:50,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:00:49" (1/3) ... [2020-10-06 00:00:50,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:00:50, skipping insertion in model container [2020-10-06 00:00:50,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:00:50" (2/3) ... [2020-10-06 00:00:50,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6fe7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:00:50, skipping insertion in model container [2020-10-06 00:00:50,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:00:50" (3/3) ... [2020-10-06 00:00:50,865 INFO L109 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2020-10-06 00:00:50,876 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:00:50,876 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:00:50,884 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:00:50,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:00:50,922 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,922 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,922 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,939 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,939 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,940 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,942 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,942 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,942 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,944 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,945 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,945 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,945 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,945 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,948 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,948 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,949 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,949 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,949 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,949 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,949 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,950 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,950 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,950 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,951 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,951 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,951 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,951 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,951 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,952 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,952 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,956 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,958 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,958 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,958 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,961 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,961 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,961 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,961 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,962 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,963 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,963 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,963 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,963 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,963 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,964 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,964 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,964 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,964 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,964 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,970 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,971 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,972 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,973 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,973 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,973 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,973 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,973 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,974 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,974 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,974 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,974 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,984 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,985 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,986 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:50,986 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:00:51,012 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:00:51,043 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:00:51,043 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:00:51,043 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:00:51,043 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:00:51,043 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:00:51,044 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:00:51,044 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:00:51,044 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:00:51,066 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 138 transitions, 298 flow [2020-10-06 00:00:51,069 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-10-06 00:00:51,144 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-10-06 00:00:51,144 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-06 00:00:51,154 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-10-06 00:00:51,161 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 138 transitions, 298 flow [2020-10-06 00:00:51,196 INFO L129 PetriNetUnfolder]: 11/138 cut-off events. [2020-10-06 00:00:51,196 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-06 00:00:51,198 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-10-06 00:00:51,204 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5744 [2020-10-06 00:00:51,206 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:00:53,923 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2020-10-06 00:00:54,149 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-06 00:00:54,511 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-06 00:00:54,721 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-06 00:00:54,734 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7699 [2020-10-06 00:00:54,734 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2020-10-06 00:00:54,739 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 102 flow [2020-10-06 00:00:54,766 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 331 states. [2020-10-06 00:00:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2020-10-06 00:00:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-06 00:00:54,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:54,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-06 00:00:54,778 INFO L427 AbstractCegarLoop]: === Iteration 1 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash -290275557, now seen corresponding path program 1 times [2020-10-06 00:00:54,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:54,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142282334] [2020-10-06 00:00:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:55,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142282334] [2020-10-06 00:00:55,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:55,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:00:55,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1522164853] [2020-10-06 00:00:55,067 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:55,071 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:55,093 INFO L258 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-10-06 00:00:55,093 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:55,099 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:55,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:00:55,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:55,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:00:55,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:00:55,119 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 3 states. [2020-10-06 00:00:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:55,240 INFO L93 Difference]: Finished difference Result 504 states and 1247 transitions. [2020-10-06 00:00:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:00:55,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-06 00:00:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:55,262 INFO L225 Difference]: With dead ends: 504 [2020-10-06 00:00:55,262 INFO L226 Difference]: Without dead ends: 460 [2020-10-06 00:00:55,264 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-10-06 00:00:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-06 00:00:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2020-10-06 00:00:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-06 00:00:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1095 transitions. [2020-10-06 00:00:55,356 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1095 transitions. Word has length 6 [2020-10-06 00:00:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:55,357 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1095 transitions. [2020-10-06 00:00:55,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:00:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1095 transitions. [2020-10-06 00:00:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 00:00:55,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:55,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:00:55,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:00:55,360 INFO L427 AbstractCegarLoop]: === Iteration 2 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:55,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:55,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1518668221, now seen corresponding path program 1 times [2020-10-06 00:00:55,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:55,362 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313500794] [2020-10-06 00:00:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:55,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313500794] [2020-10-06 00:00:55,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:55,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:00:55,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831907911] [2020-10-06 00:00:55,462 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:55,464 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:55,465 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-06 00:00:55,467 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:55,468 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:55,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:00:55,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:00:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:00:55,474 INFO L87 Difference]: Start difference. First operand 420 states and 1095 transitions. Second operand 3 states. [2020-10-06 00:00:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:55,497 INFO L93 Difference]: Finished difference Result 464 states and 1205 transitions. [2020-10-06 00:00:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:00:55,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 00:00:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:55,505 INFO L225 Difference]: With dead ends: 464 [2020-10-06 00:00:55,506 INFO L226 Difference]: Without dead ends: 464 [2020-10-06 00:00:55,507 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-10-06 00:00:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-06 00:00:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-10-06 00:00:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-10-06 00:00:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1205 transitions. [2020-10-06 00:00:55,540 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1205 transitions. Word has length 10 [2020-10-06 00:00:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:55,540 INFO L479 AbstractCegarLoop]: Abstraction has 464 states and 1205 transitions. [2020-10-06 00:00:55,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:00:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1205 transitions. [2020-10-06 00:00:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:00:55,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:55,543 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:00:55,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:00:55,543 INFO L427 AbstractCegarLoop]: === Iteration 3 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:55,543 INFO L82 PathProgramCache]: Analyzing trace with hash 542344755, now seen corresponding path program 1 times [2020-10-06 00:00:55,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:55,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355072964] [2020-10-06 00:00:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:55,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355072964] [2020-10-06 00:00:55,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230565947] [2020-10-06 00:00:55,637 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-10-06 00:00:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:55,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-06 00:00:55,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:00:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:55,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 00:00:55,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-06 00:00:55,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020050115] [2020-10-06 00:00:55,794 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:55,796 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:55,799 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 13 transitions. [2020-10-06 00:00:55,800 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:55,800 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:55,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:00:55,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:55,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:00:55,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:00:55,802 INFO L87 Difference]: Start difference. First operand 464 states and 1205 transitions. Second operand 5 states. [2020-10-06 00:00:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:55,918 INFO L93 Difference]: Finished difference Result 775 states and 1949 transitions. [2020-10-06 00:00:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:00:55,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 00:00:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:55,927 INFO L225 Difference]: With dead ends: 775 [2020-10-06 00:00:55,927 INFO L226 Difference]: Without dead ends: 775 [2020-10-06 00:00:55,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:00:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-10-06 00:00:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 592. [2020-10-06 00:00:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-10-06 00:00:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1551 transitions. [2020-10-06 00:00:55,965 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1551 transitions. Word has length 13 [2020-10-06 00:00:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:55,965 INFO L479 AbstractCegarLoop]: Abstraction has 592 states and 1551 transitions. [2020-10-06 00:00:55,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:00:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1551 transitions. [2020-10-06 00:00:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:00:55,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:55,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:00:56,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-06 00:00:56,186 INFO L427 AbstractCegarLoop]: === Iteration 4 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 843892794, now seen corresponding path program 1 times [2020-10-06 00:00:56,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:56,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218385482] [2020-10-06 00:00:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:56,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218385482] [2020-10-06 00:00:56,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:56,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:00:56,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987744789] [2020-10-06 00:00:56,304 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:56,307 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:56,312 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-10-06 00:00:56,313 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:56,396 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:56,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:00:56,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:56,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:00:56,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:00:56,398 INFO L87 Difference]: Start difference. First operand 592 states and 1551 transitions. Second operand 3 states. [2020-10-06 00:00:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:56,426 INFO L93 Difference]: Finished difference Result 311 states and 689 transitions. [2020-10-06 00:00:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:00:56,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-06 00:00:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:56,432 INFO L225 Difference]: With dead ends: 311 [2020-10-06 00:00:56,432 INFO L226 Difference]: Without dead ends: 311 [2020-10-06 00:00:56,433 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-10-06 00:00:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2020-10-06 00:00:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2020-10-06 00:00:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-10-06 00:00:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 662 transitions. [2020-10-06 00:00:56,453 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 662 transitions. Word has length 16 [2020-10-06 00:00:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:56,454 INFO L479 AbstractCegarLoop]: Abstraction has 301 states and 662 transitions. [2020-10-06 00:00:56,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:00:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 662 transitions. [2020-10-06 00:00:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:00:56,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:56,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:00:56,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:00:56,460 INFO L427 AbstractCegarLoop]: === Iteration 5 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash -960478475, now seen corresponding path program 1 times [2020-10-06 00:00:56,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:56,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396447948] [2020-10-06 00:00:56,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:56,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396447948] [2020-10-06 00:00:56,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:56,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:00:56,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100422120] [2020-10-06 00:00:56,565 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:56,568 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:56,573 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 35 transitions. [2020-10-06 00:00:56,574 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:56,575 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:56,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:00:56,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:00:56,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:00:56,577 INFO L87 Difference]: Start difference. First operand 301 states and 662 transitions. Second operand 3 states. [2020-10-06 00:00:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:56,619 INFO L93 Difference]: Finished difference Result 379 states and 830 transitions. [2020-10-06 00:00:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:00:56,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-06 00:00:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:56,622 INFO L225 Difference]: With dead ends: 379 [2020-10-06 00:00:56,623 INFO L226 Difference]: Without dead ends: 379 [2020-10-06 00:00:56,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:00:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2020-10-06 00:00:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 319. [2020-10-06 00:00:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2020-10-06 00:00:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 695 transitions. [2020-10-06 00:00:56,636 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 695 transitions. Word has length 17 [2020-10-06 00:00:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:56,638 INFO L479 AbstractCegarLoop]: Abstraction has 319 states and 695 transitions. [2020-10-06 00:00:56,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:00:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 695 transitions. [2020-10-06 00:00:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 00:00:56,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:56,640 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-06 00:00:56,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:00:56,641 INFO L427 AbstractCegarLoop]: === Iteration 6 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1582230501, now seen corresponding path program 2 times [2020-10-06 00:00:56,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:56,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214422204] [2020-10-06 00:00:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:56,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214422204] [2020-10-06 00:00:56,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292194440] [2020-10-06 00:00:56,734 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-10-06 00:00:56,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 00:00:56,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 00:00:56,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-06 00:00:56,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:00:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:56,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 00:00:56,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-10-06 00:00:56,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97774290] [2020-10-06 00:00:56,868 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:56,872 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:56,876 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-10-06 00:00:56,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:56,877 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:56,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:00:56,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:56,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:00:56,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:00:56,879 INFO L87 Difference]: Start difference. First operand 319 states and 695 transitions. Second operand 7 states. [2020-10-06 00:00:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:56,982 INFO L93 Difference]: Finished difference Result 520 states and 1122 transitions. [2020-10-06 00:00:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:00:56,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-06 00:00:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:56,986 INFO L225 Difference]: With dead ends: 520 [2020-10-06 00:00:56,987 INFO L226 Difference]: Without dead ends: 520 [2020-10-06 00:00:56,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:00:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-06 00:00:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 396. [2020-10-06 00:00:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-10-06 00:00:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 864 transitions. [2020-10-06 00:00:57,002 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 864 transitions. Word has length 20 [2020-10-06 00:00:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:57,003 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 864 transitions. [2020-10-06 00:00:57,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:00:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 864 transitions. [2020-10-06 00:00:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:00:57,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:57,004 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-10-06 00:00:57,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 00:00:57,219 INFO L427 AbstractCegarLoop]: === Iteration 7 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 69417077, now seen corresponding path program 1 times [2020-10-06 00:00:57,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:57,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016734938] [2020-10-06 00:00:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:57,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016734938] [2020-10-06 00:00:57,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:57,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 00:00:57,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1149906805] [2020-10-06 00:00:57,516 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:57,519 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:57,524 INFO L258 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-10-06 00:00:57,525 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:57,561 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:00:57,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:00:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:00:57,562 INFO L87 Difference]: Start difference. First operand 396 states and 864 transitions. Second operand 9 states. [2020-10-06 00:00:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:57,900 INFO L93 Difference]: Finished difference Result 602 states and 1308 transitions. [2020-10-06 00:00:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-06 00:00:57,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 00:00:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:57,905 INFO L225 Difference]: With dead ends: 602 [2020-10-06 00:00:57,905 INFO L226 Difference]: Without dead ends: 520 [2020-10-06 00:00:57,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-06 00:00:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-06 00:00:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 424. [2020-10-06 00:00:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-06 00:00:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 924 transitions. [2020-10-06 00:00:57,921 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 924 transitions. Word has length 21 [2020-10-06 00:00:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:57,922 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 924 transitions. [2020-10-06 00:00:57,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:00:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 924 transitions. [2020-10-06 00:00:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-06 00:00:57,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:57,924 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-10-06 00:00:57,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:00:57,924 INFO L427 AbstractCegarLoop]: === Iteration 8 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:57,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2126692033, now seen corresponding path program 1 times [2020-10-06 00:00:57,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:57,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001902333] [2020-10-06 00:00:57,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:58,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001902333] [2020-10-06 00:00:58,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731136809] [2020-10-06 00:00:58,005 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-10-06 00:00:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:58,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-06 00:00:58,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:00:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 00:00:58,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-06 00:00:58,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2020-10-06 00:00:58,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067355048] [2020-10-06 00:00:58,114 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:58,118 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:58,126 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 42 transitions. [2020-10-06 00:00:58,126 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:58,159 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:00:58,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:00:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:00:58,160 INFO L87 Difference]: Start difference. First operand 424 states and 924 transitions. Second operand 6 states. [2020-10-06 00:00:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:58,242 INFO L93 Difference]: Finished difference Result 647 states and 1381 transitions. [2020-10-06 00:00:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:00:58,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-06 00:00:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:58,247 INFO L225 Difference]: With dead ends: 647 [2020-10-06 00:00:58,247 INFO L226 Difference]: Without dead ends: 632 [2020-10-06 00:00:58,248 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-10-06 00:00:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-10-06 00:00:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 460. [2020-10-06 00:00:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2020-10-06 00:00:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 996 transitions. [2020-10-06 00:00:58,263 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 996 transitions. Word has length 24 [2020-10-06 00:00:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:58,264 INFO L479 AbstractCegarLoop]: Abstraction has 460 states and 996 transitions. [2020-10-06 00:00:58,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:00:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 996 transitions. [2020-10-06 00:00:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-06 00:00:58,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:58,266 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-10-06 00:00:58,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 00:00:58,480 INFO L427 AbstractCegarLoop]: === Iteration 9 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2004586803, now seen corresponding path program 3 times [2020-10-06 00:00:58,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:58,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934362093] [2020-10-06 00:00:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:58,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934362093] [2020-10-06 00:00:58,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940797877] [2020-10-06 00:00:58,636 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-10-06 00:00:58,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-06 00:00:58,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 00:00:58,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-06 00:00:58,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:00:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:00:58,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 00:00:58,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-10-06 00:00:58,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1121294945] [2020-10-06 00:00:58,783 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:58,788 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:58,795 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-10-06 00:00:58,796 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:58,796 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:00:58,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:00:58,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:58,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:00:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:00:58,798 INFO L87 Difference]: Start difference. First operand 460 states and 996 transitions. Second operand 9 states. [2020-10-06 00:00:58,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:00:58,925 INFO L93 Difference]: Finished difference Result 759 states and 1615 transitions. [2020-10-06 00:00:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:00:58,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-06 00:00:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:00:58,931 INFO L225 Difference]: With dead ends: 759 [2020-10-06 00:00:58,931 INFO L226 Difference]: Without dead ends: 759 [2020-10-06 00:00:58,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-06 00:00:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2020-10-06 00:00:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 553. [2020-10-06 00:00:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2020-10-06 00:00:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1211 transitions. [2020-10-06 00:00:58,952 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1211 transitions. Word has length 27 [2020-10-06 00:00:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:00:58,952 INFO L479 AbstractCegarLoop]: Abstraction has 553 states and 1211 transitions. [2020-10-06 00:00:58,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:00:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1211 transitions. [2020-10-06 00:00:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-06 00:00:58,954 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:00:58,954 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-10-06 00:00:59,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 00:00:59,168 INFO L427 AbstractCegarLoop]: === Iteration 10 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:00:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:00:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -408396195, now seen corresponding path program 2 times [2020-10-06 00:00:59,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:00:59,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231386286] [2020-10-06 00:00:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:00:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:00:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-06 00:00:59,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231386286] [2020-10-06 00:00:59,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:00:59,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-06 00:00:59,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881266952] [2020-10-06 00:00:59,701 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:00:59,706 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:00:59,716 INFO L258 McrAutomatonBuilder]: Finished intersection with 38 states and 46 transitions. [2020-10-06 00:00:59,717 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:00:59,804 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13950#(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)), 13951#(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-10-06 00:00:59,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-06 00:00:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:00:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-06 00:00:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-10-06 00:00:59,806 INFO L87 Difference]: Start difference. First operand 553 states and 1211 transitions. Second operand 17 states. [2020-10-06 00:01:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:01,771 INFO L93 Difference]: Finished difference Result 868 states and 1864 transitions. [2020-10-06 00:01:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-06 00:01:01,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-10-06 00:01:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:01,782 INFO L225 Difference]: With dead ends: 868 [2020-10-06 00:01:01,783 INFO L226 Difference]: Without dead ends: 828 [2020-10-06 00:01:01,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2020-10-06 00:01:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-10-06 00:01:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 563. [2020-10-06 00:01:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-10-06 00:01:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1242 transitions. [2020-10-06 00:01:01,801 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1242 transitions. Word has length 28 [2020-10-06 00:01:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:01,801 INFO L479 AbstractCegarLoop]: Abstraction has 563 states and 1242 transitions. [2020-10-06 00:01:01,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-06 00:01:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1242 transitions. [2020-10-06 00:01:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-06 00:01:01,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:01,803 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-10-06 00:01:01,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:01:01,804 INFO L427 AbstractCegarLoop]: === Iteration 11 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1113124825, now seen corresponding path program 2 times [2020-10-06 00:01:01,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:01,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830835658] [2020-10-06 00:01:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 00:01:01,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830835658] [2020-10-06 00:01:01,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836027244] [2020-10-06 00:01:01,893 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-10-06 00:01:01,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-06 00:01:01,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 00:01:01,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-06 00:01:01,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:01:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-06 00:01:02,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 00:01:02,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-10-06 00:01:02,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1636477508] [2020-10-06 00:01:02,004 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:02,010 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:02,022 INFO L258 McrAutomatonBuilder]: Finished intersection with 41 states and 49 transitions. [2020-10-06 00:01:02,022 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:02,046 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:02,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:01:02,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:01:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:01:02,048 INFO L87 Difference]: Start difference. First operand 563 states and 1242 transitions. Second operand 8 states. [2020-10-06 00:01:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:02,166 INFO L93 Difference]: Finished difference Result 831 states and 1775 transitions. [2020-10-06 00:01:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-06 00:01:02,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-10-06 00:01:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:02,171 INFO L225 Difference]: With dead ends: 831 [2020-10-06 00:01:02,171 INFO L226 Difference]: Without dead ends: 831 [2020-10-06 00:01:02,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-10-06 00:01:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2020-10-06 00:01:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 607. [2020-10-06 00:01:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2020-10-06 00:01:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1366 transitions. [2020-10-06 00:01:02,211 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1366 transitions. Word has length 31 [2020-10-06 00:01:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:02,211 INFO L479 AbstractCegarLoop]: Abstraction has 607 states and 1366 transitions. [2020-10-06 00:01:02,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:01:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1366 transitions. [2020-10-06 00:01:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-06 00:01:02,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:02,213 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2020-10-06 00:01:02,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-06 00:01:02,425 INFO L427 AbstractCegarLoop]: === Iteration 12 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:02,426 INFO L82 PathProgramCache]: Analyzing trace with hash 443984155, now seen corresponding path program 4 times [2020-10-06 00:01:02,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:02,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308512748] [2020-10-06 00:01:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:02,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308512748] [2020-10-06 00:01:02,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163495282] [2020-10-06 00:01:02,518 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-10-06 00:01:02,612 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-06 00:01:02,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-06 00:01:02,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-06 00:01:02,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:01:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:02,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-06 00:01:02,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2020-10-06 00:01:02,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1958096518] [2020-10-06 00:01:02,647 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:01:02,653 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:01:02,661 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-10-06 00:01:02,661 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:01:02,662 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:01:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 00:01:02,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:01:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 00:01:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-06 00:01:02,663 INFO L87 Difference]: Start difference. First operand 607 states and 1366 transitions. Second operand 11 states. [2020-10-06 00:01:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:01:02,791 INFO L93 Difference]: Finished difference Result 913 states and 1978 transitions. [2020-10-06 00:01:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-06 00:01:02,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-10-06 00:01:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:01:02,797 INFO L225 Difference]: With dead ends: 913 [2020-10-06 00:01:02,797 INFO L226 Difference]: Without dead ends: 913 [2020-10-06 00:01:02,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-06 00:01:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2020-10-06 00:01:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 684. [2020-10-06 00:01:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-10-06 00:01:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1535 transitions. [2020-10-06 00:01:02,814 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1535 transitions. Word has length 34 [2020-10-06 00:01:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:01:02,814 INFO L479 AbstractCegarLoop]: Abstraction has 684 states and 1535 transitions. [2020-10-06 00:01:02,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 00:01:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1535 transitions. [2020-10-06 00:01:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-06 00:01:02,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:01:02,816 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-10-06 00:01:03,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 00:01:03,031 INFO L427 AbstractCegarLoop]: === Iteration 13 === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:01:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:01:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1975916590, now seen corresponding path program 1 times [2020-10-06 00:01:03,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:01:03,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995566142] [2020-10-06 00:01:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:01:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:01:03,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995566142] [2020-10-06 00:01:03,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917744873] [2020-10-06 00:01:03,570 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-10-06 00:01:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:01:03,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 74 conjunts are in the unsatisfiable core [2020-10-06 00:01:03,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-06 00:01:03,814 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 00:01:03,815 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-10-06 00:01:03,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-10-06 00:01:03,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-06 00:01:03,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 8, 3, 1] term [2020-10-06 00:01:03,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 8, 3, 1] term [2020-10-06 00:01:03,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 8, 3, 1] term [2020-10-06 00:01:03,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-06 00:01:03,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-06 00:01:03,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 8, 3, 1] term [2020-10-06 00:01:03,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-06 00:01:03,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 1] term [2020-10-06 00:01:03,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-06 00:01:03,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 8, 3, 1] term [2020-10-06 00:01:03,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 1] term [2020-10-06 00:01:03,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 1] term [2020-10-06 00:01:03,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 1] term [2020-10-06 00:01:03,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-06 00:01:03,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 1] term [2020-10-06 00:01:03,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-06 00:01:03,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 7, 1] term [2020-10-06 00:01:03,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2020-10-06 00:01:03,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-06 00:01:03,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-06 00:01:03,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 8, 3, 8, 3, 1] term [2020-10-06 00:01:03,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,882 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:03,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-06 00:01:03,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-06 00:01:03,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-06 00:01:03,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:03,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:03,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-06 00:01:03,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-06 00:01:03,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:03,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:03,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,946 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:03,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,972 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-10-06 00:01:03,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:03,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 1] term [2020-10-06 00:01:03,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 1] term [2020-10-06 00:01:03,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:03,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:03,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:03,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:03,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-06 00:01:03,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-06 00:01:03,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-06 00:01:03,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:03,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:03,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-06 00:01:03,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-06 00:01:04,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:04,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-06 00:01:04,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:04,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-06 00:01:04,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,007 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:04,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:04,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:04,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,013 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,019 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-06 00:01:04,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,030 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,035 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,036 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,040 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,045 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,062 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:04,064 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,078 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:04,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,085 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:04,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-06 00:01:04,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-06 00:01:04,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-06 00:01:04,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-06 00:01:04,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-06 00:01:04,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:04,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-06 00:01:04,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:04,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-06 00:01:04,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,123 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:04,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:04,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:04,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,128 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 2, 1] term [2020-10-06 00:01:04,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 1] term [2020-10-06 00:01:04,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 7, 3, 1] term [2020-10-06 00:01:04,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 2, 1] term [2020-10-06 00:01:04,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 1] term [2020-10-06 00:01:04,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-06 00:01:04,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 1] term [2020-10-06 00:01:04,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-06 00:01:04,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2020-10-06 00:01:04,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 8, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,143 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-06 00:01:04,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 1] term [2020-10-06 00:01:04,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 1] term [2020-10-06 00:01:04,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:01:04,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-10-06 00:01:04,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 00:01:04,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 8, 2, 8, 2, 1] term [2020-10-06 00:01:04,149 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-06 00:01:04,157 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 00:01:04,757 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 60 [2020-10-06 00:01:04,759 INFO L625 ElimStorePlain]: treesize reduction 9793, result has 0.9 percent of original size [2020-10-06 00:01:04,782 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-10-06 00:01:04,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-06 00:01:04,984 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-10-06 00:01:04,990 INFO L168 Benchmark]: Toolchain (without parser) took 15777.14 ms. Allocated memory was 140.0 MB in the beginning and 381.2 MB in the end (delta: 241.2 MB). Free memory was 100.9 MB in the beginning and 154.2 MB in the end (delta: -53.3 MB). Peak memory consumption was 219.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,991 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.91 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 134.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.90 ms. Allocated memory is still 203.4 MB. Free memory was 134.2 MB in the beginning and 131.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,993 INFO L168 Benchmark]: Boogie Preprocessor took 41.12 ms. Allocated memory is still 203.4 MB. Free memory was 131.6 MB in the beginning and 129.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,993 INFO L168 Benchmark]: RCFGBuilder took 588.25 ms. Allocated memory is still 203.4 MB. Free memory was 129.6 MB in the beginning and 96.8 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,994 INFO L168 Benchmark]: TraceAbstraction took 14129.60 ms. Allocated memory was 203.4 MB in the beginning and 381.2 MB in the end (delta: 177.7 MB). Free memory was 96.8 MB in the beginning and 154.2 MB in the end (delta: -57.4 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:01:04,998 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.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 929.91 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 134.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.90 ms. Allocated memory is still 203.4 MB. Free memory was 134.2 MB in the beginning and 131.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.12 ms. Allocated memory is still 203.4 MB. Free memory was 131.6 MB in the beginning and 129.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 588.25 ms. Allocated memory is still 203.4 MB. Free memory was 129.6 MB in the beginning and 96.8 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14129.60 ms. Allocated memory was 203.4 MB in the beginning and 381.2 MB in the end (delta: 177.7 MB). Free memory was 96.8 MB in the beginning and 154.2 MB in the end (delta: -57.4 MB). Peak memory consumption was 152.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 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...