/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:57:38,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:57:38,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:57:38,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:57:38,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:57:38,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:57:38,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:57:38,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:57:38,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:57:38,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:57:38,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:57:38,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:57:38,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:57:38,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:57:38,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:57:38,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:57:38,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:57:38,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:57:38,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:57:38,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:57:38,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:57:38,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:57:38,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:57:38,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:57:38,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:57:38,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:57:38,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:57:38,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:57:38,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:57:38,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:57:38,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:57:38,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:57:38,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:57:38,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:57:38,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:57:38,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:57:38,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:57:38,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:57:38,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:57:38,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:57:38,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:57:38,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 08:57:39,185 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:57:39,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:57:39,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:57:39,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:57:39,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:57:39,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:57:39,188 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:57:39,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:57:39,189 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:57:39,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:57:39,190 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:57:39,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:57:39,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:57:39,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:57:39,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:57:39,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:57:39,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:57:39,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:57:39,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:57:39,194 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:57:39,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 08:57:39,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:57:39,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:57:39,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:57:39,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:57:39,533 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:57:39,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2021-06-05 08:57:39,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b37860c/7906384329114d4b8ecfbacdc9ebfe1f/FLAGd950f2eb3 [2021-06-05 08:57:40,060 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:57:40,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2021-06-05 08:57:40,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b37860c/7906384329114d4b8ecfbacdc9ebfe1f/FLAGd950f2eb3 [2021-06-05 08:57:40,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b37860c/7906384329114d4b8ecfbacdc9ebfe1f [2021-06-05 08:57:40,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:57:40,089 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:57:40,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:57:40,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:57:40,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:57:40,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1c82eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40, skipping insertion in model container [2021-06-05 08:57:40,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:57:40,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:57:40,507 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2021-06-05 08:57:40,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:57:40,524 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:57:40,566 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i[30726,30739] [2021-06-05 08:57:40,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:57:40,645 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:57:40,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40 WrapperNode [2021-06-05 08:57:40,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:57:40,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:57:40,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:57:40,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:57:40,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:57:40,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:57:40,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:57:40,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:57:40,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (1/1) ... [2021-06-05 08:57:40,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:57:40,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:57:40,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:57:40,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:57:40,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (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 [2021-06-05 08:57:40,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 08:57:40,792 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:57:40,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:57:40,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:57:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:57:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:57:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:57:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:57:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:57:40,797 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 08:57:41,363 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:57:41,363 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 08:57:41,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:57:41 BoogieIcfgContainer [2021-06-05 08:57:41,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:57:41,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:57:41,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:57:41,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:57:41,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:57:40" (1/3) ... [2021-06-05 08:57:41,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3c50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:57:41, skipping insertion in model container [2021-06-05 08:57:41,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:57:40" (2/3) ... [2021-06-05 08:57:41,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e3c50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:57:41, skipping insertion in model container [2021-06-05 08:57:41,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:57:41" (3/3) ... [2021-06-05 08:57:41,371 INFO L111 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2021-06-05 08:57:41,377 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:57:41,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:57:41,378 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 08:57:41,378 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:57:41,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,407 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,412 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,413 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,414 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,415 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,416 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,417 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,418 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,419 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,420 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,421 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,422 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,423 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,424 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,424 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,425 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,426 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,426 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,427 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,430 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,430 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,431 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,437 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,438 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,439 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,440 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,441 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,441 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,442 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,443 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,444 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,445 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:41,451 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:57:41,469 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 08:57:41,483 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:57:41,483 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:57:41,483 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:57:41,483 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:57:41,483 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:57:41,483 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:57:41,483 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:57:41,484 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:57:41,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 71 transitions, 147 flow [2021-06-05 08:57:41,519 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 531 states, 526 states have (on average 2.074144486692015) internal successors, (1091), 530 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 526 states have (on average 2.074144486692015) internal successors, (1091), 530 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 08:57:41,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:41,537 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:41,538 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1584534205, now seen corresponding path program 1 times [2021-06-05 08:57:41,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:41,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769373037] [2021-06-05 08:57:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:57:41,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:41,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769373037] [2021-06-05 08:57:41,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769373037] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:41,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:41,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 08:57:41,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075596450] [2021-06-05 08:57:41,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:57:41,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:57:41,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:57:41,851 INFO L87 Difference]: Start difference. First operand has 531 states, 526 states have (on average 2.074144486692015) internal successors, (1091), 530 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:41,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:41,927 INFO L93 Difference]: Finished difference Result 503 states and 933 transitions. [2021-06-05 08:57:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:57:41,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-06-05 08:57:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:41,940 INFO L225 Difference]: With dead ends: 503 [2021-06-05 08:57:41,940 INFO L226 Difference]: Without dead ends: 495 [2021-06-05 08:57:41,941 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:57:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-06-05 08:57:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 371. [2021-06-05 08:57:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.8567567567567567) internal successors, (687), 370 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 687 transitions. [2021-06-05 08:57:41,991 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 687 transitions. Word has length 39 [2021-06-05 08:57:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:41,992 INFO L482 AbstractCegarLoop]: Abstraction has 371 states and 687 transitions. [2021-06-05 08:57:41,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 687 transitions. [2021-06-05 08:57:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 08:57:41,994 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:41,994 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:41,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:57:41,995 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash 64662303, now seen corresponding path program 1 times [2021-06-05 08:57:41,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:41,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667332884] [2021-06-05 08:57:41,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:57:42,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:42,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667332884] [2021-06-05 08:57:42,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667332884] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:42,080 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:42,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:57:42,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634736710] [2021-06-05 08:57:42,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:57:42,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:57:42,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:57:42,086 INFO L87 Difference]: Start difference. First operand 371 states and 687 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:42,130 INFO L93 Difference]: Finished difference Result 371 states and 679 transitions. [2021-06-05 08:57:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:57:42,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 08:57:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:42,132 INFO L225 Difference]: With dead ends: 371 [2021-06-05 08:57:42,132 INFO L226 Difference]: Without dead ends: 331 [2021-06-05 08:57:42,136 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:57:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-06-05 08:57:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 251. [2021-06-05 08:57:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.816) internal successors, (454), 250 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 454 transitions. [2021-06-05 08:57:42,148 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 454 transitions. Word has length 45 [2021-06-05 08:57:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:42,149 INFO L482 AbstractCegarLoop]: Abstraction has 251 states and 454 transitions. [2021-06-05 08:57:42,149 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 454 transitions. [2021-06-05 08:57:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:57:42,151 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:42,151 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:42,151 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:57:42,151 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:42,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1962219978, now seen corresponding path program 1 times [2021-06-05 08:57:42,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:42,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409256211] [2021-06-05 08:57:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:57:42,253 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:42,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409256211] [2021-06-05 08:57:42,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409256211] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:42,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:42,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:57:42,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340433914] [2021-06-05 08:57:42,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:57:42,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:57:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:57:42,256 INFO L87 Difference]: Start difference. First operand 251 states and 454 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:42,413 INFO L93 Difference]: Finished difference Result 481 states and 856 transitions. [2021-06-05 08:57:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:57:42,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:57:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:42,415 INFO L225 Difference]: With dead ends: 481 [2021-06-05 08:57:42,415 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 08:57:42,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 70.1ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:57:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 08:57:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 219. [2021-06-05 08:57:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.7522935779816513) internal successors, (382), 218 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 382 transitions. [2021-06-05 08:57:42,426 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 382 transitions. Word has length 47 [2021-06-05 08:57:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:42,426 INFO L482 AbstractCegarLoop]: Abstraction has 219 states and 382 transitions. [2021-06-05 08:57:42,426 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 382 transitions. [2021-06-05 08:57:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:57:42,428 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:42,428 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:42,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 08:57:42,429 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:42,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -340122736, now seen corresponding path program 1 times [2021-06-05 08:57:42,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:42,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866185559] [2021-06-05 08:57:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:42,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:42,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866185559] [2021-06-05 08:57:42,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866185559] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:42,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344551260] [2021-06-05 08:57:42,673 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 [2021-06-05 08:57:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:42,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 08:57:42,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:42,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:57:42,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:42,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:42,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:42,908 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:57:43,033 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:43,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:57:43,037 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:43,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,043 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:57:43,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:57:43,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:43,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 08:57:43,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:57:43,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:43,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,224 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:57:43,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:57:43,270 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:43,272 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:43,272 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:57:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:43,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344551260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:43,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:43,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2021-06-05 08:57:43,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908741013] [2021-06-05 08:57:43,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:57:43,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:57:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:57:43,310 INFO L87 Difference]: Start difference. First operand 219 states and 382 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:43,713 INFO L93 Difference]: Finished difference Result 559 states and 1006 transitions. [2021-06-05 08:57:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 08:57:43,714 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:57:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:43,717 INFO L225 Difference]: With dead ends: 559 [2021-06-05 08:57:43,717 INFO L226 Difference]: Without dead ends: 525 [2021-06-05 08:57:43,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 329.8ms TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:57:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-06-05 08:57:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 339. [2021-06-05 08:57:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.7810650887573964) internal successors, (602), 338 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 602 transitions. [2021-06-05 08:57:43,744 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 602 transitions. Word has length 53 [2021-06-05 08:57:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:43,751 INFO L482 AbstractCegarLoop]: Abstraction has 339 states and 602 transitions. [2021-06-05 08:57:43,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 602 transitions. [2021-06-05 08:57:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 08:57:43,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:43,755 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:43,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:57:43,973 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:43,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:43,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1113233479, now seen corresponding path program 1 times [2021-06-05 08:57:43,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:43,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307638293] [2021-06-05 08:57:43,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:44,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:44,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307638293] [2021-06-05 08:57:44,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307638293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:44,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321567736] [2021-06-05 08:57:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-06-05 08:57:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:44,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:57:44,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:44,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:57:44,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,387 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:57:44,474 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:57:44,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:57:44,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,486 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:57:44,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:57:44,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:44,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-06-05 08:57:44,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-06-05 08:57:44,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,778 INFO L628 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2021-06-05 08:57:44,781 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:44,781 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2021-06-05 08:57:44,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:44,911 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:57:44,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2021-06-05 08:57:44,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,925 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:44,925 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2021-06-05 08:57:44,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:44,960 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:44,985 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:57:44,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-06-05 08:57:44,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:45,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,001 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2021-06-05 08:57:45,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:57:45,057 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:45,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,067 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:57:45,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:57:45,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:45,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,105 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:57:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:45,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321567736] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:45,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:45,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2021-06-05 08:57:45,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254374134] [2021-06-05 08:57:45,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:57:45,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:57:45,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:57:45,146 INFO L87 Difference]: Start difference. First operand 339 states and 602 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:46,098 INFO L93 Difference]: Finished difference Result 715 states and 1292 transitions. [2021-06-05 08:57:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:57:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 08:57:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:46,101 INFO L225 Difference]: With dead ends: 715 [2021-06-05 08:57:46,101 INFO L226 Difference]: Without dead ends: 681 [2021-06-05 08:57:46,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 815.3ms TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 08:57:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2021-06-05 08:57:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 495. [2021-06-05 08:57:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.7975708502024292) internal successors, (888), 494 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 888 transitions. [2021-06-05 08:57:46,114 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 888 transitions. Word has length 79 [2021-06-05 08:57:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:46,114 INFO L482 AbstractCegarLoop]: Abstraction has 495 states and 888 transitions. [2021-06-05 08:57:46,115 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 24 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:46,115 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 888 transitions. [2021-06-05 08:57:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-05 08:57:46,117 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:46,117 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:46,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:57:46,338 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1715428002, now seen corresponding path program 2 times [2021-06-05 08:57:46,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:46,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882936116] [2021-06-05 08:57:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:46,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:46,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882936116] [2021-06-05 08:57:46,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882936116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:46,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718082956] [2021-06-05 08:57:46,887 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 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 [2021-06-05 08:57:46,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:57:46,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:57:46,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:57:46,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:47,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:57:47,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:47,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,025 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:57:47,081 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:57:47,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:57:47,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:47,091 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,091 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:57:47,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:57:47,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:47,135 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:47,136 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2021-06-05 08:57:47,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:57:47,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,296 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:57:47,298 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:47,299 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:21 [2021-06-05 08:57:47,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:47,446 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-06-05 08:57:47,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2021-06-05 08:57:47,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:47,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:47,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:37 [2021-06-05 08:57:47,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:47,570 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:47,613 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 08:57:47,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:57:47,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,637 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 08:57:47,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:57:47,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,700 INFO L628 ElimStorePlain]: treesize reduction 4, result has 95.6 percent of original size [2021-06-05 08:57:47,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:47,704 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2021-06-05 08:57:47,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:57:47,891 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,917 INFO L354 Elim1Store]: treesize reduction 50, result has 20.6 percent of original size [2021-06-05 08:57:47,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 27 [2021-06-05 08:57:47,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:47,957 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2021-06-05 08:57:47,960 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:47,960 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:51 [2021-06-05 08:57:48,114 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:48,133 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-06-05 08:57:48,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 10 [2021-06-05 08:57:48,136 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,150 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:57:48,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:57:48,153 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:48,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:48,172 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:41 [2021-06-05 08:57:48,325 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-06-05 08:57:48,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2021-06-05 08:57:48,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,359 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.3 percent of original size [2021-06-05 08:57:48,371 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-06-05 08:57:48,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2021-06-05 08:57:48,373 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:48,388 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:48,388 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:47 [2021-06-05 08:57:48,559 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:57:48,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:57:48,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:48,579 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,579 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2021-06-05 08:57:48,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:57:48,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,621 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:48,621 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:48,621 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:57:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:48,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718082956] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:48,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:48,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 36 [2021-06-05 08:57:48,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137367383] [2021-06-05 08:57:48,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-05 08:57:48,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-05 08:57:48,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:57:48,685 INFO L87 Difference]: Start difference. First operand 495 states and 888 transitions. Second operand has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:50,932 INFO L93 Difference]: Finished difference Result 871 states and 1578 transitions. [2021-06-05 08:57:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:57:50,932 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-05 08:57:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:50,935 INFO L225 Difference]: With dead ends: 871 [2021-06-05 08:57:50,935 INFO L226 Difference]: Without dead ends: 837 [2021-06-05 08:57:50,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 2100.5ms TimeCoverageRelationStatistics Valid=617, Invalid=3939, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 08:57:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2021-06-05 08:57:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 651. [2021-06-05 08:57:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 650 states have (on average 1.8061538461538462) internal successors, (1174), 650 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1174 transitions. [2021-06-05 08:57:50,951 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1174 transitions. Word has length 105 [2021-06-05 08:57:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:50,951 INFO L482 AbstractCegarLoop]: Abstraction has 651 states and 1174 transitions. [2021-06-05 08:57:50,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 4.888888888888889) internal successors, (176), 36 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1174 transitions. [2021-06-05 08:57:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-06-05 08:57:50,954 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:50,954 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:51,178 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:57:51,178 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash -566817717, now seen corresponding path program 3 times [2021-06-05 08:57:51,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:51,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955083447] [2021-06-05 08:57:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:51,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:51,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955083447] [2021-06-05 08:57:51,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955083447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:51,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422034758] [2021-06-05 08:57:51,788 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 [2021-06-05 08:57:51,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 08:57:51,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:57:51,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2021-06-05 08:57:51,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:51,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:57:51,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:51,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:51,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:51,964 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:57:52,014 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:57:52,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:57:52,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,023 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:57:52,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:57:52,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2021-06-05 08:57:52,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-06-05 08:57:52,170 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,186 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:57:52,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,190 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2021-06-05 08:57:52,279 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:52,312 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:57:52,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:57:52,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,336 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,337 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:37 [2021-06-05 08:57:52,425 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:52,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:57:52,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:57:52,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,469 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:52,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:57:52,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:52,502 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:63 [2021-06-05 08:57:52,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:57:52,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,681 INFO L628 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2021-06-05 08:57:52,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,683 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2021-06-05 08:57:52,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:52,825 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:57:52,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:57:52,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,841 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,842 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:34 [2021-06-05 08:57:52,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:57:52,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 08:57:52,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 08:57:52,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:52,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:52,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:52,920 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:20 [2021-06-05 08:57:53,057 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-06-05 08:57:53,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2021-06-05 08:57:53,059 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,071 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 08:57:53,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:53,075 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2021-06-05 08:57:53,223 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:53,225 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:53,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:53,252 INFO L354 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2021-06-05 08:57:53,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:57:53,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:53,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:4 [2021-06-05 08:57:53,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 08:57:53,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:53,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,382 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2021-06-05 08:57:53,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-06-05 08:57:53,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:53,400 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:53,400 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2021-06-05 08:57:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:53,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422034758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:53,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:53,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 40 [2021-06-05 08:57:53,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062389456] [2021-06-05 08:57:53,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-06-05 08:57:53,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:53,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-06-05 08:57:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:57:53,412 INFO L87 Difference]: Start difference. First operand 651 states and 1174 transitions. Second operand has 40 states, 40 states have (on average 5.375) internal successors, (215), 40 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:55,479 INFO L93 Difference]: Finished difference Result 731 states and 1322 transitions. [2021-06-05 08:57:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 08:57:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.375) internal successors, (215), 40 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-06-05 08:57:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:55,480 INFO L225 Difference]: With dead ends: 731 [2021-06-05 08:57:55,480 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:57:55,482 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 2283.0ms TimeCoverageRelationStatistics Valid=793, Invalid=4609, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 08:57:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:57:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:57:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:57:55,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2021-06-05 08:57:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:55,482 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:57:55,482 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 5.375) internal successors, (215), 40 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:57:55,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:57:55,683 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:57:55,683 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:57:55,685 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:57:55,686 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:57:55,686 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:57:55,686 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:57:55,686 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:57:55,686 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:57:55,686 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:57:55,686 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:57:55,686 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:57:55,688 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 71 transitions, 147 flow [2021-06-05 08:57:55,696 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 531 states, 526 states have (on average 2.074144486692015) internal successors, (1091), 530 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 526 states have (on average 2.074144486692015) internal successors, (1091), 530 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 08:57:55,698 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:55,698 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:55,698 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:57:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash -657798906, now seen corresponding path program 1 times [2021-06-05 08:57:55,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:55,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538085724] [2021-06-05 08:57:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:57:55,705 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:57:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:57:55,709 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:57:55,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:57:55,737 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:57:55,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 08:57:55,737 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:57:55,737 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:57:55,738 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,752 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,758 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,759 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,760 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,761 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,761 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,762 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,763 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,764 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,765 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,771 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,780 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,782 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,783 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,784 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,785 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,785 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,786 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,787 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,787 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:57:55,788 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:57:55,789 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 08:57:55,790 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:57:55,790 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:57:55,790 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:57:55,790 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:57:55,790 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:57:55,790 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:57:55,790 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:57:55,790 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:57:55,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 115 transitions, 242 flow [2021-06-05 08:57:57,040 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20265 states, 20254 states have (on average 3.180754418880221) internal successors, (64423), 20264 states have internal predecessors, (64423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 20265 states, 20254 states have (on average 3.180754418880221) internal successors, (64423), 20264 states have internal predecessors, (64423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 08:57:57,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:57,096 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:57,096 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1096975105, now seen corresponding path program 1 times [2021-06-05 08:57:57,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:57,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327493829] [2021-06-05 08:57:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:57:57,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:57,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327493829] [2021-06-05 08:57:57,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327493829] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:57,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:57,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 08:57:57,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36874515] [2021-06-05 08:57:57,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:57:57,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:57:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:57:57,172 INFO L87 Difference]: Start difference. First operand has 20265 states, 20254 states have (on average 3.180754418880221) internal successors, (64423), 20264 states have internal predecessors, (64423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:57,332 INFO L93 Difference]: Finished difference Result 12665 states and 36590 transitions. [2021-06-05 08:57:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:57:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-06-05 08:57:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:57,398 INFO L225 Difference]: With dead ends: 12665 [2021-06-05 08:57:57,399 INFO L226 Difference]: Without dead ends: 12657 [2021-06-05 08:57:57,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:57:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12657 states. [2021-06-05 08:57:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12657 to 11118. [2021-06-05 08:57:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11118 states, 11115 states have (on average 2.8995051731893837) internal successors, (32228), 11117 states have internal predecessors, (32228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11118 states to 11118 states and 32228 transitions. [2021-06-05 08:57:57,977 INFO L78 Accepts]: Start accepts. Automaton has 11118 states and 32228 transitions. Word has length 39 [2021-06-05 08:57:57,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:57,977 INFO L482 AbstractCegarLoop]: Abstraction has 11118 states and 32228 transitions. [2021-06-05 08:57:57,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:57,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11118 states and 32228 transitions. [2021-06-05 08:57:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-06-05 08:57:57,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:57,982 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:57,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 08:57:57,982 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 657379961, now seen corresponding path program 1 times [2021-06-05 08:57:57,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:57,984 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246580403] [2021-06-05 08:57:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:57:58,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:58,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246580403] [2021-06-05 08:57:58,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246580403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:58,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:58,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:57:58,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372978718] [2021-06-05 08:57:58,013 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:57:58,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:57:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:57:58,014 INFO L87 Difference]: Start difference. First operand 11118 states and 32228 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:58,078 INFO L93 Difference]: Finished difference Result 11118 states and 31941 transitions. [2021-06-05 08:57:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:57:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-06-05 08:57:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:58,126 INFO L225 Difference]: With dead ends: 11118 [2021-06-05 08:57:58,126 INFO L226 Difference]: Without dead ends: 11078 [2021-06-05 08:57:58,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:57:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11078 states. [2021-06-05 08:57:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11078 to 11070. [2021-06-05 08:57:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11070 states, 11067 states have (on average 2.874401373452607) internal successors, (31811), 11069 states have internal predecessors, (31811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11070 states to 11070 states and 31811 transitions. [2021-06-05 08:57:58,466 INFO L78 Accepts]: Start accepts. Automaton has 11070 states and 31811 transitions. Word has length 45 [2021-06-05 08:57:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:58,466 INFO L482 AbstractCegarLoop]: Abstraction has 11070 states and 31811 transitions. [2021-06-05 08:57:58,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 11070 states and 31811 transitions. [2021-06-05 08:57:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 08:57:58,472 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:58,472 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:58,473 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 08:57:58,473 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:58,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 365268668, now seen corresponding path program 1 times [2021-06-05 08:57:58,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:58,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105441518] [2021-06-05 08:57:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:57:58,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:58,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105441518] [2021-06-05 08:57:58,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105441518] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:58,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:58,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:57:58,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709715847] [2021-06-05 08:57:58,497 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:57:58,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:57:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:57:58,498 INFO L87 Difference]: Start difference. First operand 11070 states and 31811 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:58,587 INFO L93 Difference]: Finished difference Result 11070 states and 31523 transitions. [2021-06-05 08:57:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:57:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 08:57:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:58,615 INFO L225 Difference]: With dead ends: 11070 [2021-06-05 08:57:58,615 INFO L226 Difference]: Without dead ends: 10830 [2021-06-05 08:57:58,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:57:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10830 states. [2021-06-05 08:57:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10830 to 10790. [2021-06-05 08:57:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10790 states, 10787 states have (on average 2.847687030685084) internal successors, (30718), 10789 states have internal predecessors, (30718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10790 states to 10790 states and 30718 transitions. [2021-06-05 08:57:59,103 INFO L78 Accepts]: Start accepts. Automaton has 10790 states and 30718 transitions. Word has length 46 [2021-06-05 08:57:59,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:59,104 INFO L482 AbstractCegarLoop]: Abstraction has 10790 states and 30718 transitions. [2021-06-05 08:57:59,116 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10790 states and 30718 transitions. [2021-06-05 08:57:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:57:59,121 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:59,122 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:57:59,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 08:57:59,122 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1176780664, now seen corresponding path program 1 times [2021-06-05 08:57:59,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:59,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503762964] [2021-06-05 08:57:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:57:59,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:59,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503762964] [2021-06-05 08:57:59,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503762964] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:59,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:59,167 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:57:59,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310008874] [2021-06-05 08:57:59,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:57:59,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:57:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:57:59,170 INFO L87 Difference]: Start difference. First operand 10790 states and 30718 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:57:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:59,681 INFO L93 Difference]: Finished difference Result 29003 states and 82734 transitions. [2021-06-05 08:57:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:57:59,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:57:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:59,750 INFO L225 Difference]: With dead ends: 29003 [2021-06-05 08:57:59,752 INFO L226 Difference]: Without dead ends: 28307 [2021-06-05 08:57:59,752 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:57:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28307 states. [2021-06-05 08:58:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28307 to 16504. [2021-06-05 08:58:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16504 states, 16501 states have (on average 2.867220168474638) internal successors, (47312), 16503 states have internal predecessors, (47312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16504 states to 16504 states and 47312 transitions. [2021-06-05 08:58:00,335 INFO L78 Accepts]: Start accepts. Automaton has 16504 states and 47312 transitions. Word has length 47 [2021-06-05 08:58:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:00,335 INFO L482 AbstractCegarLoop]: Abstraction has 16504 states and 47312 transitions. [2021-06-05 08:58:00,335 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16504 states and 47312 transitions. [2021-06-05 08:58:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-06-05 08:58:00,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:00,435 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:00,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 08:58:00,435 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 235617444, now seen corresponding path program 1 times [2021-06-05 08:58:00,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:00,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002901272] [2021-06-05 08:58:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:00,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:00,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002901272] [2021-06-05 08:58:00,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002901272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:00,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014044237] [2021-06-05 08:58:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2021-06-05 08:58:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:00,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 08:58:00,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:00,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:00,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:00,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:00,738 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:00,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:00,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:00,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:00,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:58:00,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:00,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,773 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 08:58:00,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:00,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,823 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:00,825 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,825 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:58:00,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:00,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:00,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:00,844 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:00,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014044237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:00,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:00,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2021-06-05 08:58:00,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562457326] [2021-06-05 08:58:00,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:58:00,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:00,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:58:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:58:00,873 INFO L87 Difference]: Start difference. First operand 16504 states and 47312 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:02,675 INFO L93 Difference]: Finished difference Result 65891 states and 186154 transitions. [2021-06-05 08:58:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 08:58:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-06-05 08:58:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:02,879 INFO L225 Difference]: With dead ends: 65891 [2021-06-05 08:58:02,879 INFO L226 Difference]: Without dead ends: 65471 [2021-06-05 08:58:02,880 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 626.0ms TimeCoverageRelationStatistics Valid=398, Invalid=2152, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 08:58:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65471 states. [2021-06-05 08:58:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65471 to 17907. [2021-06-05 08:58:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17907 states, 17904 states have (on average 2.8718163538873993) internal successors, (51417), 17906 states have internal predecessors, (51417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17907 states to 17907 states and 51417 transitions. [2021-06-05 08:58:03,978 INFO L78 Accepts]: Start accepts. Automaton has 17907 states and 51417 transitions. Word has length 53 [2021-06-05 08:58:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:03,978 INFO L482 AbstractCegarLoop]: Abstraction has 17907 states and 51417 transitions. [2021-06-05 08:58:03,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 16 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand 17907 states and 51417 transitions. [2021-06-05 08:58:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-05 08:58:03,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:03,987 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:04,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:04,213 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 414178243, now seen corresponding path program 1 times [2021-06-05 08:58:04,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:04,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438147695] [2021-06-05 08:58:04,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:58:04,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:04,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438147695] [2021-06-05 08:58:04,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438147695] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:04,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:04,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:58:04,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054572381] [2021-06-05 08:58:04,250 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:58:04,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:58:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:58:04,252 INFO L87 Difference]: Start difference. First operand 17907 states and 51417 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:04,606 INFO L93 Difference]: Finished difference Result 36602 states and 104390 transitions. [2021-06-05 08:58:04,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:58:04,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-06-05 08:58:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:04,667 INFO L225 Difference]: With dead ends: 36602 [2021-06-05 08:58:04,668 INFO L226 Difference]: Without dead ends: 35966 [2021-06-05 08:58:04,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 50.2ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:58:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35966 states. [2021-06-05 08:58:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35966 to 20759. [2021-06-05 08:58:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20759 states, 20756 states have (on average 2.872470610907689) internal successors, (59621), 20758 states have internal predecessors, (59621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20759 states to 20759 states and 59621 transitions. [2021-06-05 08:58:05,421 INFO L78 Accepts]: Start accepts. Automaton has 20759 states and 59621 transitions. Word has length 54 [2021-06-05 08:58:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:05,422 INFO L482 AbstractCegarLoop]: Abstraction has 20759 states and 59621 transitions. [2021-06-05 08:58:05,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 20759 states and 59621 transitions. [2021-06-05 08:58:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 08:58:05,443 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:05,444 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:05,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 08:58:05,444 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1185364941, now seen corresponding path program 2 times [2021-06-05 08:58:05,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:05,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898619999] [2021-06-05 08:58:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:05,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:05,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898619999] [2021-06-05 08:58:05,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898619999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:05,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995257996] [2021-06-05 08:58:05,570 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 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 [2021-06-05 08:58:05,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:58:05,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:05,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 08:58:05,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:05,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:05,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,679 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:05,732 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:05,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:05,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,739 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,740 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,740 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:05,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:58:05,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,771 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 08:58:05,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:05,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,830 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:58:05,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:05,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,852 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:05,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995257996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:05,883 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:05,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2021-06-05 08:58:05,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815955974] [2021-06-05 08:58:05,884 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:58:05,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:58:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:58:05,885 INFO L87 Difference]: Start difference. First operand 20759 states and 59621 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:07,664 INFO L93 Difference]: Finished difference Result 69588 states and 195580 transitions. [2021-06-05 08:58:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:58:07,665 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 08:58:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:07,757 INFO L225 Difference]: With dead ends: 69588 [2021-06-05 08:58:07,757 INFO L226 Difference]: Without dead ends: 69192 [2021-06-05 08:58:07,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 594.2ms TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 08:58:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69192 states. [2021-06-05 08:58:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69192 to 22015. [2021-06-05 08:58:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22015 states, 22012 states have (on average 2.8788388151917137) internal successors, (63369), 22014 states have internal predecessors, (63369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 63369 transitions. [2021-06-05 08:58:08,557 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 63369 transitions. Word has length 60 [2021-06-05 08:58:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:08,557 INFO L482 AbstractCegarLoop]: Abstraction has 22015 states and 63369 transitions. [2021-06-05 08:58:08,557 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 63369 transitions. [2021-06-05 08:58:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:58:08,575 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:08,576 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:08,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:08,789 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1059682609, now seen corresponding path program 1 times [2021-06-05 08:58:08,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:08,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726977187] [2021-06-05 08:58:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:09,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:09,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726977187] [2021-06-05 08:58:09,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726977187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:09,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451261469] [2021-06-05 08:58:09,080 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 [2021-06-05 08:58:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:09,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 08:58:09,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:09,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:09,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,190 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:09,230 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:09,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:09,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:09,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:09,268 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,276 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 08:58:09,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:58:09,334 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,347 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2021-06-05 08:58:09,423 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:58:09,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 08:58:09,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:09,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:28 [2021-06-05 08:58:09,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:09,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,499 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:09,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-06-05 08:58:09,501 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:09,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:09,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:09,508 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2021-06-05 08:58:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:09,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451261469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:09,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:09,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2021-06-05 08:58:09,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954872676] [2021-06-05 08:58:09,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:09,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:09,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:09,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:09,558 INFO L87 Difference]: Start difference. First operand 22015 states and 63369 transitions. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:11,990 INFO L93 Difference]: Finished difference Result 72408 states and 207147 transitions. [2021-06-05 08:58:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-06-05 08:58:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:58:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:12,081 INFO L225 Difference]: With dead ends: 72408 [2021-06-05 08:58:12,082 INFO L226 Difference]: Without dead ends: 71856 [2021-06-05 08:58:12,083 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1567.7ms TimeCoverageRelationStatistics Valid=619, Invalid=3287, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:58:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71856 states. [2021-06-05 08:58:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71856 to 22707. [2021-06-05 08:58:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22707 states, 22704 states have (on average 2.874515503875969) internal successors, (65263), 22706 states have internal predecessors, (65263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22707 states to 22707 states and 65263 transitions. [2021-06-05 08:58:12,814 INFO L78 Accepts]: Start accepts. Automaton has 22707 states and 65263 transitions. Word has length 63 [2021-06-05 08:58:12,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:12,814 INFO L482 AbstractCegarLoop]: Abstraction has 22707 states and 65263 transitions. [2021-06-05 08:58:12,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 22707 states and 65263 transitions. [2021-06-05 08:58:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:58:12,831 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:12,831 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:13,034 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:13,035 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -892769484, now seen corresponding path program 1 times [2021-06-05 08:58:13,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:13,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730035963] [2021-06-05 08:58:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:13,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:13,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730035963] [2021-06-05 08:58:13,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730035963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:13,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:13,128 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:58:13,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256469601] [2021-06-05 08:58:13,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:58:13,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:58:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:58:13,131 INFO L87 Difference]: Start difference. First operand 22707 states and 65263 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:14,049 INFO L93 Difference]: Finished difference Result 43132 states and 122565 transitions. [2021-06-05 08:58:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:58:14,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:58:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:14,104 INFO L225 Difference]: With dead ends: 43132 [2021-06-05 08:58:14,104 INFO L226 Difference]: Without dead ends: 42844 [2021-06-05 08:58:14,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 240.0ms TimeCoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:58:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42844 states. [2021-06-05 08:58:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42844 to 22931. [2021-06-05 08:58:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22931 states, 22928 states have (on average 2.87452023726448) internal successors, (65907), 22930 states have internal predecessors, (65907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22931 states to 22931 states and 65907 transitions. [2021-06-05 08:58:14,717 INFO L78 Accepts]: Start accepts. Automaton has 22931 states and 65907 transitions. Word has length 63 [2021-06-05 08:58:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:14,718 INFO L482 AbstractCegarLoop]: Abstraction has 22931 states and 65907 transitions. [2021-06-05 08:58:14,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22931 states and 65907 transitions. [2021-06-05 08:58:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:58:14,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:14,736 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:14,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-05 08:58:14,736 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1498556132, now seen corresponding path program 2 times [2021-06-05 08:58:14,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:14,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988659880] [2021-06-05 08:58:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:58:14,837 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:14,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988659880] [2021-06-05 08:58:14,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988659880] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:14,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:14,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:58:14,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807510008] [2021-06-05 08:58:14,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:58:14,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:14,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:58:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:58:14,838 INFO L87 Difference]: Start difference. First operand 22931 states and 65907 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:15,912 INFO L93 Difference]: Finished difference Result 45920 states and 131238 transitions. [2021-06-05 08:58:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:58:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:58:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:15,970 INFO L225 Difference]: With dead ends: 45920 [2021-06-05 08:58:15,971 INFO L226 Difference]: Without dead ends: 45644 [2021-06-05 08:58:15,971 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 329.0ms TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:58:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45644 states. [2021-06-05 08:58:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45644 to 23257. [2021-06-05 08:58:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23257 states, 23254 states have (on average 2.872366044551475) internal successors, (66794), 23256 states have internal predecessors, (66794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23257 states to 23257 states and 66794 transitions. [2021-06-05 08:58:16,550 INFO L78 Accepts]: Start accepts. Automaton has 23257 states and 66794 transitions. Word has length 63 [2021-06-05 08:58:16,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:16,551 INFO L482 AbstractCegarLoop]: Abstraction has 23257 states and 66794 transitions. [2021-06-05 08:58:16,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand 23257 states and 66794 transitions. [2021-06-05 08:58:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 08:58:16,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:16,563 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:16,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-05 08:58:16,564 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:16,564 INFO L82 PathProgramCache]: Analyzing trace with hash -653689086, now seen corresponding path program 3 times [2021-06-05 08:58:16,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:16,564 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013871970] [2021-06-05 08:58:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:58:16,654 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:16,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013871970] [2021-06-05 08:58:16,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013871970] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:16,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:16,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:58:16,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7262603] [2021-06-05 08:58:16,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:58:16,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:58:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:58:16,655 INFO L87 Difference]: Start difference. First operand 23257 states and 66794 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:17,411 INFO L93 Difference]: Finished difference Result 44434 states and 126671 transitions. [2021-06-05 08:58:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 08:58:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 08:58:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:17,465 INFO L225 Difference]: With dead ends: 44434 [2021-06-05 08:58:17,465 INFO L226 Difference]: Without dead ends: 44158 [2021-06-05 08:58:17,465 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 177.3ms TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:58:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44158 states. [2021-06-05 08:58:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44158 to 23139. [2021-06-05 08:58:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23139 states, 23136 states have (on average 2.872017634854772) internal successors, (66447), 23138 states have internal predecessors, (66447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23139 states to 23139 states and 66447 transitions. [2021-06-05 08:58:18,099 INFO L78 Accepts]: Start accepts. Automaton has 23139 states and 66447 transitions. Word has length 63 [2021-06-05 08:58:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:18,099 INFO L482 AbstractCegarLoop]: Abstraction has 23139 states and 66447 transitions. [2021-06-05 08:58:18,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23139 states and 66447 transitions. [2021-06-05 08:58:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:18,111 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:18,111 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:18,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 08:58:18,111 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1862964223, now seen corresponding path program 2 times [2021-06-05 08:58:18,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:18,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077118609] [2021-06-05 08:58:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:18,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:18,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077118609] [2021-06-05 08:58:18,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077118609] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:18,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809153114] [2021-06-05 08:58:18,293 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:18,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:58:18,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:18,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 08:58:18,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:18,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:18,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,403 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,403 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:18,443 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:18,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:18,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,450 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,450 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:18,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:58:18,475 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,482 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,482 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 08:58:18,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:18,530 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,539 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2021-06-05 08:58:18,628 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:18,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:58:18,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,642 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:18,642 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:26 [2021-06-05 08:58:18,738 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:58:18,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:58:18,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:18,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:18,775 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 08:58:18,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:18,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,814 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:18,818 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:18,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:18,823 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:18,823 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 08:58:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:18,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809153114] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:18,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:18,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2021-06-05 08:58:18,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594042807] [2021-06-05 08:58:18,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:18,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:18,869 INFO L87 Difference]: Start difference. First operand 23139 states and 66447 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:21,428 INFO L93 Difference]: Finished difference Result 68372 states and 192752 transitions. [2021-06-05 08:58:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-06-05 08:58:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:21,518 INFO L225 Difference]: With dead ends: 68372 [2021-06-05 08:58:21,518 INFO L226 Difference]: Without dead ends: 67844 [2021-06-05 08:58:21,519 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1553.2ms TimeCoverageRelationStatistics Valid=954, Invalid=4448, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 08:58:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67844 states. [2021-06-05 08:58:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67844 to 24965. [2021-06-05 08:58:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24965 states, 24962 states have (on average 2.8850252383623105) internal successors, (72016), 24964 states have internal predecessors, (72016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24965 states to 24965 states and 72016 transitions. [2021-06-05 08:58:22,308 INFO L78 Accepts]: Start accepts. Automaton has 24965 states and 72016 transitions. Word has length 69 [2021-06-05 08:58:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:22,308 INFO L482 AbstractCegarLoop]: Abstraction has 24965 states and 72016 transitions. [2021-06-05 08:58:22,308 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 24965 states and 72016 transitions. [2021-06-05 08:58:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:22,323 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:22,323 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:22,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-06-05 08:58:22,524 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:22,524 INFO L82 PathProgramCache]: Analyzing trace with hash 494630546, now seen corresponding path program 4 times [2021-06-05 08:58:22,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:22,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777767138] [2021-06-05 08:58:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:22,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:22,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777767138] [2021-06-05 08:58:22,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777767138] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:22,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869439358] [2021-06-05 08:58:22,629 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:22,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:58:22,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:22,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 08:58:22,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:22,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:22,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:22,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:22,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:22,750 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:22,807 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:58:22,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:58:22,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:22,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:22,816 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:22,816 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:58:22,930 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:58:22,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:58:22,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:22,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:22,940 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:22,940 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:8 [2021-06-05 08:58:23,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 08:58:23,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:23,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:23,049 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:23,049 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2021-06-05 08:58:23,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-06-05 08:58:23,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:23,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:23,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:23,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2021-06-05 08:58:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:23,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869439358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:23,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:23,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2021-06-05 08:58:23,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251545026] [2021-06-05 08:58:23,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:23,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:23,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:23,068 INFO L87 Difference]: Start difference. First operand 24965 states and 72016 transitions. Second operand has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:26,289 INFO L93 Difference]: Finished difference Result 93685 states and 262605 transitions. [2021-06-05 08:58:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-06-05 08:58:26,289 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:26,417 INFO L225 Difference]: With dead ends: 93685 [2021-06-05 08:58:26,417 INFO L226 Difference]: Without dead ends: 91149 [2021-06-05 08:58:26,419 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5177 ImplicationChecksByTransitivity, 1398.8ms TimeCoverageRelationStatistics Valid=1655, Invalid=11917, Unknown=0, NotChecked=0, Total=13572 [2021-06-05 08:58:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91149 states. [2021-06-05 08:58:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91149 to 35709. [2021-06-05 08:58:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35709 states, 35704 states have (on average 2.8864272910598254) internal successors, (103057), 35708 states have internal predecessors, (103057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35709 states to 35709 states and 103057 transitions. [2021-06-05 08:58:27,484 INFO L78 Accepts]: Start accepts. Automaton has 35709 states and 103057 transitions. Word has length 69 [2021-06-05 08:58:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:27,484 INFO L482 AbstractCegarLoop]: Abstraction has 35709 states and 103057 transitions. [2021-06-05 08:58:27,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:27,484 INFO L276 IsEmpty]: Start isEmpty. Operand 35709 states and 103057 transitions. [2021-06-05 08:58:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:27,501 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:27,502 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:27,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 08:58:27,717 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:27,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1304841857, now seen corresponding path program 3 times [2021-06-05 08:58:27,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:27,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082843903] [2021-06-05 08:58:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:27,822 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:27,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082843903] [2021-06-05 08:58:27,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082843903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:27,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543543387] [2021-06-05 08:58:27,822 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:27,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 08:58:27,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:27,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 08:58:27,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:27,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:27,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:27,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,934 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:27,966 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:27,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:27,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:27,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,971 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:58:28,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:58:28,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,005 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:28,006 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:15 [2021-06-05 08:58:28,042 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:58:28,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-06-05 08:58:28,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,055 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2021-06-05 08:58:28,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:28,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,100 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,100 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2021-06-05 08:58:28,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:28,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,117 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:28,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543543387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:28,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:28,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2021-06-05 08:58:28,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913473514] [2021-06-05 08:58:28,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 08:58:28,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:28,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 08:58:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 08:58:28,145 INFO L87 Difference]: Start difference. First operand 35709 states and 103057 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:28,693 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2021-06-05 08:58:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:31,018 INFO L93 Difference]: Finished difference Result 123422 states and 349597 transitions. [2021-06-05 08:58:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-05 08:58:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:31,194 INFO L225 Difference]: With dead ends: 123422 [2021-06-05 08:58:31,194 INFO L226 Difference]: Without dead ends: 122894 [2021-06-05 08:58:31,195 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 919.8ms TimeCoverageRelationStatistics Valid=572, Invalid=3460, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 08:58:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122894 states. [2021-06-05 08:58:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122894 to 37919. [2021-06-05 08:58:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37919 states, 37914 states have (on average 2.894682702959329) internal successors, (109749), 37918 states have internal predecessors, (109749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37919 states to 37919 states and 109749 transitions. [2021-06-05 08:58:32,626 INFO L78 Accepts]: Start accepts. Automaton has 37919 states and 109749 transitions. Word has length 69 [2021-06-05 08:58:32,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:32,626 INFO L482 AbstractCegarLoop]: Abstraction has 37919 states and 109749 transitions. [2021-06-05 08:58:32,626 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 37919 states and 109749 transitions. [2021-06-05 08:58:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:32,648 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:32,649 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:32,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:32,865 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1172216408, now seen corresponding path program 5 times [2021-06-05 08:58:32,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:32,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687001268] [2021-06-05 08:58:32,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:33,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:33,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687001268] [2021-06-05 08:58:33,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687001268] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:33,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084038586] [2021-06-05 08:58:33,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:33,147 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:58:33,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:33,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 08:58:33,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:33,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:33,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,188 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:33,231 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:58:33,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:58:33,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-06-05 08:58:33,296 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:58:33,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:58:33,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,306 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2021-06-05 08:58:33,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:33,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,344 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:58:33,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 08:58:33,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:33,393 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2021-06-05 08:58:33,539 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:58:33,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-06-05 08:58:33,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:43, output treesize:11 [2021-06-05 08:58:33,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:33,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:33,589 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:33,589 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:33,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084038586] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:33,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:33,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2021-06-05 08:58:33,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610724798] [2021-06-05 08:58:33,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:33,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:33,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:33,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:33,620 INFO L87 Difference]: Start difference. First operand 37919 states and 109749 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:36,366 INFO L93 Difference]: Finished difference Result 81749 states and 232963 transitions. [2021-06-05 08:58:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-05 08:58:36,367 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:36,478 INFO L225 Difference]: With dead ends: 81749 [2021-06-05 08:58:36,479 INFO L226 Difference]: Without dead ends: 81485 [2021-06-05 08:58:36,479 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 780.1ms TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 08:58:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81485 states. [2021-06-05 08:58:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81485 to 38215. [2021-06-05 08:58:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38215 states, 38210 states have (on average 2.8970688301491756) internal successors, (110697), 38214 states have internal predecessors, (110697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38215 states to 38215 states and 110697 transitions. [2021-06-05 08:58:37,441 INFO L78 Accepts]: Start accepts. Automaton has 38215 states and 110697 transitions. Word has length 69 [2021-06-05 08:58:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:37,441 INFO L482 AbstractCegarLoop]: Abstraction has 38215 states and 110697 transitions. [2021-06-05 08:58:37,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 38215 states and 110697 transitions. [2021-06-05 08:58:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:37,460 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:37,460 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:37,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-06-05 08:58:37,667 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash -323404957, now seen corresponding path program 4 times [2021-06-05 08:58:37,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:37,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246521087] [2021-06-05 08:58:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:38,039 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:38,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246521087] [2021-06-05 08:58:38,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246521087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:38,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162336290] [2021-06-05 08:58:38,040 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:38,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:58:38,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:38,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 08:58:38,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:38,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:38,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,152 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:38,189 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:38,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:38,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:38,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:38,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 08:58:38,315 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:58:38,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 08:58:38,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:38,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 08:58:38,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:38,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,703 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:58:38,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2021-06-05 08:58:38,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:38,732 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:23 [2021-06-05 08:58:38,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:38,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:38,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,772 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:38,772 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 08:58:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:38,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162336290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:38,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:38,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2021-06-05 08:58:38,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54182535] [2021-06-05 08:58:38,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:38,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:38,809 INFO L87 Difference]: Start difference. First operand 38215 states and 110697 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:40,420 INFO L93 Difference]: Finished difference Result 80444 states and 229381 transitions. [2021-06-05 08:58:40,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 08:58:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:40,527 INFO L225 Difference]: With dead ends: 80444 [2021-06-05 08:58:40,528 INFO L226 Difference]: Without dead ends: 80180 [2021-06-05 08:58:40,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1130.4ms TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:58:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80180 states. [2021-06-05 08:58:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80180 to 38215. [2021-06-05 08:58:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38215 states, 38210 states have (on average 2.8970688301491756) internal successors, (110697), 38214 states have internal predecessors, (110697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38215 states to 38215 states and 110697 transitions. [2021-06-05 08:58:41,472 INFO L78 Accepts]: Start accepts. Automaton has 38215 states and 110697 transitions. Word has length 69 [2021-06-05 08:58:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:41,473 INFO L482 AbstractCegarLoop]: Abstraction has 38215 states and 110697 transitions. [2021-06-05 08:58:41,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 38215 states and 110697 transitions. [2021-06-05 08:58:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:41,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:41,491 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:41,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:41,691 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1144155630, now seen corresponding path program 6 times [2021-06-05 08:58:41,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:41,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209940821] [2021-06-05 08:58:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:41,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:41,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209940821] [2021-06-05 08:58:41,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209940821] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:41,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312477276] [2021-06-05 08:58:41,830 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:41,900 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:58:41,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:41,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 08:58:41,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:41,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:41,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:41,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:41,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:41,937 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:42,012 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:42,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:58:42,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,018 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,019 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:42,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:58:42,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 08:58:42,129 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:42,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:58:42,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:42,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:26 [2021-06-05 08:58:42,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:42,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,232 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:58:42,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:58:42,234 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:42,260 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 08:58:42,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:42,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:42,298 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:42,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:42,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:42,302 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 08:58:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:42,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312477276] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:42,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:42,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2021-06-05 08:58:42,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141012369] [2021-06-05 08:58:42,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:58:42,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:58:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:58:42,340 INFO L87 Difference]: Start difference. First operand 38215 states and 110697 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:45,345 INFO L93 Difference]: Finished difference Result 95577 states and 271560 transitions. [2021-06-05 08:58:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-06-05 08:58:45,345 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:45,467 INFO L225 Difference]: With dead ends: 95577 [2021-06-05 08:58:45,467 INFO L226 Difference]: Without dead ends: 95049 [2021-06-05 08:58:45,468 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1480.1ms TimeCoverageRelationStatistics Valid=954, Invalid=4448, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 08:58:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95049 states. [2021-06-05 08:58:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95049 to 38247. [2021-06-05 08:58:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38247 states, 38242 states have (on average 2.898723916113174) internal successors, (110853), 38246 states have internal predecessors, (110853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38247 states to 38247 states and 110853 transitions. [2021-06-05 08:58:46,488 INFO L78 Accepts]: Start accepts. Automaton has 38247 states and 110853 transitions. Word has length 69 [2021-06-05 08:58:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:46,488 INFO L482 AbstractCegarLoop]: Abstraction has 38247 states and 110853 transitions. [2021-06-05 08:58:46,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38247 states and 110853 transitions. [2021-06-05 08:58:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:46,505 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:46,505 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:46,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2021-06-05 08:58:46,709 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1050187455, now seen corresponding path program 5 times [2021-06-05 08:58:46,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:46,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4829271] [2021-06-05 08:58:46,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:46,813 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:46,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4829271] [2021-06-05 08:58:46,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4829271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:46,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14592532] [2021-06-05 08:58:46,814 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:46,890 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:58:46,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:46,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:58:46,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:46,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:46,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:46,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:46,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:46,932 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:47,006 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:58:47,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:58:47,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:47,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 08:58:47,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:47,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:47,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2021-06-05 08:58:47,096 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:58:47,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:58:47,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:47,108 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2021-06-05 08:58:47,154 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 08:58:47,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 08:58:47,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:18 [2021-06-05 08:58:47,413 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-06-05 08:58:47,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:47,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,477 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:58:47,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:47,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:47,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:47,498 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:47,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14592532] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:47,525 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:47,525 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-06-05 08:58:47,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467983060] [2021-06-05 08:58:47,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:58:47,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:58:47,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:58:47,526 INFO L87 Difference]: Start difference. First operand 38247 states and 110853 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:50,867 INFO L93 Difference]: Finished difference Result 122252 states and 345977 transitions. [2021-06-05 08:58:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-06-05 08:58:50,868 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:51,042 INFO L225 Difference]: With dead ends: 122252 [2021-06-05 08:58:51,042 INFO L226 Difference]: Without dead ends: 121652 [2021-06-05 08:58:51,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 1356.8ms TimeCoverageRelationStatistics Valid=878, Invalid=6604, Unknown=0, NotChecked=0, Total=7482 [2021-06-05 08:58:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121652 states. [2021-06-05 08:58:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121652 to 39104. [2021-06-05 08:58:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39104 states, 39099 states have (on average 2.898283843576562) internal successors, (113320), 39103 states have internal predecessors, (113320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39104 states to 39104 states and 113320 transitions. [2021-06-05 08:58:52,396 INFO L78 Accepts]: Start accepts. Automaton has 39104 states and 113320 transitions. Word has length 69 [2021-06-05 08:58:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:52,397 INFO L482 AbstractCegarLoop]: Abstraction has 39104 states and 113320 transitions. [2021-06-05 08:58:52,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 23 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39104 states and 113320 transitions. [2021-06-05 08:58:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:52,414 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:52,414 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:52,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:52,615 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1610825644, now seen corresponding path program 7 times [2021-06-05 08:58:52,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:52,616 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472981694] [2021-06-05 08:58:52,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:58:52,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:52,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472981694] [2021-06-05 08:58:52,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472981694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:52,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129052019] [2021-06-05 08:58:52,757 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:52,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 08:58:52,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:52,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:52,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:52,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:52,940 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:58:52,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:58:52,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:52,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,950 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:58:52,985 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:58:52,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:58:52,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:52,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:52,995 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-06-05 08:58:53,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:53,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:53,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,032 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 08:58:53,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:53,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:53,099 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:53,099 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2021-06-05 08:58:53,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:58:53,147 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:53,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:53,162 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-06-05 08:58:53,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:58:53,192 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:53,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:53,197 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:58:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:58:53,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129052019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:53,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:53,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2021-06-05 08:58:53,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195685202] [2021-06-05 08:58:53,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 08:58:53,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 08:58:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:58:53,229 INFO L87 Difference]: Start difference. First operand 39104 states and 113320 transitions. Second operand has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:55,143 INFO L93 Difference]: Finished difference Result 77940 states and 223196 transitions. [2021-06-05 08:58:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 08:58:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:55,254 INFO L225 Difference]: With dead ends: 77940 [2021-06-05 08:58:55,254 INFO L226 Difference]: Without dead ends: 77868 [2021-06-05 08:58:55,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 481.1ms TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 08:58:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77868 states. [2021-06-05 08:58:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77868 to 38564. [2021-06-05 08:58:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38564 states, 38559 states have (on average 2.896807489820794) internal successors, (111698), 38563 states have internal predecessors, (111698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38564 states to 38564 states and 111698 transitions. [2021-06-05 08:58:56,286 INFO L78 Accepts]: Start accepts. Automaton has 38564 states and 111698 transitions. Word has length 69 [2021-06-05 08:58:56,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:56,286 INFO L482 AbstractCegarLoop]: Abstraction has 38564 states and 111698 transitions. [2021-06-05 08:58:56,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.238095238095238) internal successors, (89), 21 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 38564 states and 111698 transitions. [2021-06-05 08:58:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:58:56,303 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:56,303 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:56,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:56,504 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:56,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1579814121, now seen corresponding path program 6 times [2021-06-05 08:58:56,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:56,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596468620] [2021-06-05 08:58:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:58:56,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:56,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596468620] [2021-06-05 08:58:56,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596468620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:56,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235519401] [2021-06-05 08:58:56,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:56,739 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:58:56,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:56,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 08:58:56,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:56,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:58:56,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:56,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:56,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:56,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:58:56,822 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:58:56,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:58:56,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:56,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:56,829 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:56,829 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2021-06-05 08:58:57,051 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:58:57,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:58:57,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:57,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,061 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2021-06-05 08:58:57,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:58:57,082 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:57,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,089 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:58:57,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:58:57,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:57,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:57,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2021-06-05 08:58:57,252 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:58:57,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:58:57,254 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:57,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:37, output treesize:11 [2021-06-05 08:58:57,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:58:57,294 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:57,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:57,296 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:58:57,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235519401] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:57,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:57,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-06-05 08:58:57,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453240678] [2021-06-05 08:58:57,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 08:58:57,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 08:58:57,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 08:58:57,326 INFO L87 Difference]: Start difference. First operand 38564 states and 111698 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:58,639 INFO L93 Difference]: Finished difference Result 78473 states and 223693 transitions. [2021-06-05 08:58:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:58:58,639 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:58:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:58,907 INFO L225 Difference]: With dead ends: 78473 [2021-06-05 08:58:58,907 INFO L226 Difference]: Without dead ends: 78209 [2021-06-05 08:58:58,907 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 740.2ms TimeCoverageRelationStatistics Valid=367, Invalid=1703, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 08:58:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78209 states. [2021-06-05 08:58:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78209 to 38088. [2021-06-05 08:58:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38088 states, 38083 states have (on average 2.8951500669590104) internal successors, (110256), 38087 states have internal predecessors, (110256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38088 states to 38088 states and 110256 transitions. [2021-06-05 08:58:59,867 INFO L78 Accepts]: Start accepts. Automaton has 38088 states and 110256 transitions. Word has length 69 [2021-06-05 08:58:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:59,868 INFO L482 AbstractCegarLoop]: Abstraction has 38088 states and 110256 transitions. [2021-06-05 08:58:59,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:58:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 38088 states and 110256 transitions. [2021-06-05 08:58:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 08:58:59,889 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:59,889 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:00,090 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:00,090 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1471070214, now seen corresponding path program 1 times [2021-06-05 08:59:00,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:00,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738955560] [2021-06-05 08:59:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:00,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:00,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738955560] [2021-06-05 08:59:00,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738955560] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:00,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657271468] [2021-06-05 08:59:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:00,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 08:59:00,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:00,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657271468] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:59:00,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:59:00,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2021-06-05 08:59:00,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066686221] [2021-06-05 08:59:00,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:59:00,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:00,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:59:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:59:00,457 INFO L87 Difference]: Start difference. First operand 38088 states and 110256 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:00,543 INFO L93 Difference]: Finished difference Result 29916 states and 86642 transitions. [2021-06-05 08:59:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:59:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 08:59:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:00,584 INFO L225 Difference]: With dead ends: 29916 [2021-06-05 08:59:00,584 INFO L226 Difference]: Without dead ends: 29916 [2021-06-05 08:59:00,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 142.5ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:59:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29916 states. [2021-06-05 08:59:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29916 to 29916. [2021-06-05 08:59:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29916 states, 29913 states have (on average 2.896466419282586) internal successors, (86642), 29915 states have internal predecessors, (86642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29916 states to 29916 states and 86642 transitions. [2021-06-05 08:59:01,368 INFO L78 Accepts]: Start accepts. Automaton has 29916 states and 86642 transitions. Word has length 76 [2021-06-05 08:59:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:01,368 INFO L482 AbstractCegarLoop]: Abstraction has 29916 states and 86642 transitions. [2021-06-05 08:59:01,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29916 states and 86642 transitions. [2021-06-05 08:59:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 08:59:01,387 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:01,387 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:01,587 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2021-06-05 08:59:01,587 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1748973075, now seen corresponding path program 1 times [2021-06-05 08:59:01,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:01,588 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564347305] [2021-06-05 08:59:01,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 08:59:01,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:01,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564347305] [2021-06-05 08:59:01,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564347305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:01,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269345775] [2021-06-05 08:59:01,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:01,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:59:01,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:01,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:01,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,888 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:01,922 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:01,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:59:01,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,932 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:59:01,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:01,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:01,973 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2021-06-05 08:59:02,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-06-05 08:59:02,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,097 INFO L628 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2021-06-05 08:59:02,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:02,099 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2021-06-05 08:59:02,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:02,196 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:59:02,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 20 [2021-06-05 08:59:02,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:02,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2021-06-05 08:59:02,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:02,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:02,261 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 08:59:02,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 08:59:02,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:15 [2021-06-05 08:59:02,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:59:02,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,323 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:59:02,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:59:02,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,344 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:59:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 08:59:02,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269345775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:02,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:02,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2021-06-05 08:59:02,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521972503] [2021-06-05 08:59:02,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:59:02,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:02,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:59:02,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:59:02,375 INFO L87 Difference]: Start difference. First operand 29916 states and 86642 transitions. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:04,480 INFO L93 Difference]: Finished difference Result 74577 states and 213061 transitions. [2021-06-05 08:59:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 08:59:04,481 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 08:59:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:04,581 INFO L225 Difference]: With dead ends: 74577 [2021-06-05 08:59:04,581 INFO L226 Difference]: Without dead ends: 74241 [2021-06-05 08:59:04,582 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 871.3ms TimeCoverageRelationStatistics Valid=564, Invalid=3218, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 08:59:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74241 states. [2021-06-05 08:59:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74241 to 32136. [2021-06-05 08:59:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32136 states, 32133 states have (on average 2.9072915694146206) internal successors, (93420), 32135 states have internal predecessors, (93420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32136 states to 32136 states and 93420 transitions. [2021-06-05 08:59:05,443 INFO L78 Accepts]: Start accepts. Automaton has 32136 states and 93420 transitions. Word has length 79 [2021-06-05 08:59:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:05,443 INFO L482 AbstractCegarLoop]: Abstraction has 32136 states and 93420 transitions. [2021-06-05 08:59:05,443 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 32136 states and 93420 transitions. [2021-06-05 08:59:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:59:05,464 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:05,464 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:05,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 08:59:05,667 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1418751114, now seen corresponding path program 1 times [2021-06-05 08:59:05,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:05,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798483208] [2021-06-05 08:59:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:05,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:05,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:05,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798483208] [2021-06-05 08:59:05,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798483208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:05,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119339135] [2021-06-05 08:59:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:05,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 08:59:05,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:05,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:05,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:05,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:05,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:05,968 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:06,008 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:06,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:59:06,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:59:06,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-06-05 08:59:06,083 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,091 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:59:06,092 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:06,092 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2021-06-05 08:59:06,196 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:59:06,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 23 [2021-06-05 08:59:06,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,205 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2021-06-05 08:59:06,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:59:06,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,236 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2021-06-05 08:59:06,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:59:06,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,304 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,304 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:59:06,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:59:06,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:59:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:06,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119339135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:06,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:06,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2021-06-05 08:59:06,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560295732] [2021-06-05 08:59:06,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:59:06,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:59:06,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:59:06,364 INFO L87 Difference]: Start difference. First operand 32136 states and 93420 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:06,680 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2021-06-05 08:59:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:11,185 INFO L93 Difference]: Finished difference Result 95030 states and 271079 transitions. [2021-06-05 08:59:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2021-06-05 08:59:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:59:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:11,398 INFO L225 Difference]: With dead ends: 95030 [2021-06-05 08:59:11,398 INFO L226 Difference]: Without dead ends: 94694 [2021-06-05 08:59:11,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5894 ImplicationChecksByTransitivity, 2614.6ms TimeCoverageRelationStatistics Valid=1494, Invalid=14508, Unknown=0, NotChecked=0, Total=16002 [2021-06-05 08:59:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94694 states. [2021-06-05 08:59:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94694 to 33438. [2021-06-05 08:59:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33438 states, 33435 states have (on average 2.911081202332885) internal successors, (97332), 33437 states have internal predecessors, (97332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33438 states to 33438 states and 97332 transitions. [2021-06-05 08:59:12,401 INFO L78 Accepts]: Start accepts. Automaton has 33438 states and 97332 transitions. Word has length 82 [2021-06-05 08:59:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:12,401 INFO L482 AbstractCegarLoop]: Abstraction has 33438 states and 97332 transitions. [2021-06-05 08:59:12,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:12,401 INFO L276 IsEmpty]: Start isEmpty. Operand 33438 states and 97332 transitions. [2021-06-05 08:59:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:59:12,423 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:12,423 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:12,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:12,625 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1665179508, now seen corresponding path program 2 times [2021-06-05 08:59:12,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:12,628 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739015190] [2021-06-05 08:59:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:59:12,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:12,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739015190] [2021-06-05 08:59:12,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739015190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:12,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811871856] [2021-06-05 08:59:12,798 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:12,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:59:12,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:12,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:59:12,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:12,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:12,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:12,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:12,928 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:59:12,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:59:12,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:12,935 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,935 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 08:59:12,977 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:59:12,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:59:12,979 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:12,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:12,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2021-06-05 08:59:13,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:13,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:13,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,018 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-06-05 08:59:13,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:59:13,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,129 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.6 percent of original size [2021-06-05 08:59:13,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:13,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-06-05 08:59:13,278 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:59:13,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:59:13,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,288 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:13,292 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,292 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2021-06-05 08:59:13,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:59:13,309 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:13,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:13,310 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:59:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:13,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811871856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:13,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:13,332 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2021-06-05 08:59:13,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940846154] [2021-06-05 08:59:13,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:59:13,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:59:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:59:13,334 INFO L87 Difference]: Start difference. First operand 33438 states and 97332 transitions. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:15,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:15,500 INFO L93 Difference]: Finished difference Result 86846 states and 249270 transitions. [2021-06-05 08:59:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-05 08:59:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:59:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:15,613 INFO L225 Difference]: With dead ends: 86846 [2021-06-05 08:59:15,613 INFO L226 Difference]: Without dead ends: 86510 [2021-06-05 08:59:15,613 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 855.6ms TimeCoverageRelationStatistics Valid=702, Invalid=4268, Unknown=0, NotChecked=0, Total=4970 [2021-06-05 08:59:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86510 states. [2021-06-05 08:59:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86510 to 34404. [2021-06-05 08:59:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34404 states, 34401 states have (on average 2.918577948315456) internal successors, (100402), 34403 states have internal predecessors, (100402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34404 states to 34404 states and 100402 transitions. [2021-06-05 08:59:16,587 INFO L78 Accepts]: Start accepts. Automaton has 34404 states and 100402 transitions. Word has length 82 [2021-06-05 08:59:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:16,587 INFO L482 AbstractCegarLoop]: Abstraction has 34404 states and 100402 transitions. [2021-06-05 08:59:16,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34404 states and 100402 transitions. [2021-06-05 08:59:16,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:59:16,608 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:16,608 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:16,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2021-06-05 08:59:16,811 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1164033094, now seen corresponding path program 1 times [2021-06-05 08:59:16,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:16,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388151773] [2021-06-05 08:59:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:17,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:17,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388151773] [2021-06-05 08:59:17,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388151773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:17,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943649922] [2021-06-05 08:59:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:17,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:59:17,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:17,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:17,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,113 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,113 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:17,172 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:17,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:59:17,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,180 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:59:17,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:59:17,206 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:17,214 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2021-06-05 08:59:17,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 08:59:17,315 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,327 INFO L628 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 08:59:17,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:17,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:21 [2021-06-05 08:59:17,380 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:59:17,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:59:17,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:17,391 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:18 [2021-06-05 08:59:17,440 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:59:17,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-06-05 08:59:17,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2021-06-05 08:59:17,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:59:17,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,739 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,740 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:59:17,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:59:17,760 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:59:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:17,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943649922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:17,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:17,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2021-06-05 08:59:17,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304104981] [2021-06-05 08:59:17,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:59:17,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:59:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:59:17,788 INFO L87 Difference]: Start difference. First operand 34404 states and 100402 transitions. Second operand has 24 states, 24 states have (on average 4.625) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:23,221 INFO L93 Difference]: Finished difference Result 93917 states and 268442 transitions. [2021-06-05 08:59:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2021-06-05 08:59:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.625) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:59:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:23,342 INFO L225 Difference]: With dead ends: 93917 [2021-06-05 08:59:23,342 INFO L226 Difference]: Without dead ends: 93581 [2021-06-05 08:59:23,343 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6247 ImplicationChecksByTransitivity, 2672.1ms TimeCoverageRelationStatistics Valid=1647, Invalid=15123, Unknown=0, NotChecked=0, Total=16770 [2021-06-05 08:59:23,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93581 states. [2021-06-05 08:59:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93581 to 33652. [2021-06-05 08:59:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33652 states, 33649 states have (on average 2.9161044904752) internal successors, (98124), 33651 states have internal predecessors, (98124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33652 states to 33652 states and 98124 transitions. [2021-06-05 08:59:24,313 INFO L78 Accepts]: Start accepts. Automaton has 33652 states and 98124 transitions. Word has length 82 [2021-06-05 08:59:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:24,313 INFO L482 AbstractCegarLoop]: Abstraction has 33652 states and 98124 transitions. [2021-06-05 08:59:24,313 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.625) internal successors, (111), 24 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 33652 states and 98124 transitions. [2021-06-05 08:59:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:59:24,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:24,338 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:24,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2021-06-05 08:59:24,538 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1751782886, now seen corresponding path program 1 times [2021-06-05 08:59:24,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:24,539 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475619330] [2021-06-05 08:59:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:24,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:24,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475619330] [2021-06-05 08:59:24,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475619330] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:24,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134402508] [2021-06-05 08:59:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:24,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 08:59:24,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:24,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:24,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:24,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:24,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:24,873 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:24,914 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:24,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:59:24,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:24,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:24,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:24,922 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 08:59:24,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:24,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:24,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:24,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:24,962 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2021-06-05 08:59:25,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2021-06-05 08:59:25,058 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,068 INFO L628 ElimStorePlain]: treesize reduction 4, result has 86.2 percent of original size [2021-06-05 08:59:25,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:25,070 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:25 [2021-06-05 08:59:25,129 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:25,154 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:59:25,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 35 [2021-06-05 08:59:25,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:25,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2021-06-05 08:59:25,200 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:25,201 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:59:25,224 INFO L354 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2021-06-05 08:59:25,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2021-06-05 08:59:25,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,240 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2021-06-05 08:59:25,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 08:59:25,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:25,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:36 [2021-06-05 08:59:25,394 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:59:25,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2021-06-05 08:59:25,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,406 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,406 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:24 [2021-06-05 08:59:25,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 08:59:25,444 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,453 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:25,453 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-06-05 08:59:25,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2021-06-05 08:59:25,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:25,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:25,508 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:3 [2021-06-05 08:59:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:25,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134402508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:25,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:25,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2021-06-05 08:59:25,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265738902] [2021-06-05 08:59:25,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 08:59:25,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:25,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 08:59:25,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:59:25,551 INFO L87 Difference]: Start difference. First operand 33652 states and 98124 transitions. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:29,827 INFO L93 Difference]: Finished difference Result 94498 states and 271861 transitions. [2021-06-05 08:59:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-06-05 08:59:29,828 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 08:59:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:29,943 INFO L225 Difference]: With dead ends: 94498 [2021-06-05 08:59:29,943 INFO L226 Difference]: Without dead ends: 93970 [2021-06-05 08:59:29,944 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3990 ImplicationChecksByTransitivity, 2392.1ms TimeCoverageRelationStatistics Valid=1394, Invalid=10162, Unknown=0, NotChecked=0, Total=11556 [2021-06-05 08:59:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93970 states. [2021-06-05 08:59:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93970 to 38984. [2021-06-05 08:59:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38984 states, 38981 states have (on average 2.91726738667556) internal successors, (113718), 38983 states have internal predecessors, (113718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38984 states to 38984 states and 113718 transitions. [2021-06-05 08:59:30,968 INFO L78 Accepts]: Start accepts. Automaton has 38984 states and 113718 transitions. Word has length 89 [2021-06-05 08:59:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:30,968 INFO L482 AbstractCegarLoop]: Abstraction has 38984 states and 113718 transitions. [2021-06-05 08:59:30,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 28 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 38984 states and 113718 transitions. [2021-06-05 08:59:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:59:31,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:31,003 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:31,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:31,204 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash -385651246, now seen corresponding path program 2 times [2021-06-05 08:59:31,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:31,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109349452] [2021-06-05 08:59:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:31,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:31,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109349452] [2021-06-05 08:59:31,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109349452] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:31,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661862019] [2021-06-05 08:59:31,326 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:31,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:59:31,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:31,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:59:31,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:31,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:31,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:31,453 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:31,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:31,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:31,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:59:31,493 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:31,506 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:31,506 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2021-06-05 08:59:31,755 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-05 08:59:31,781 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:31,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:59:31,783 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,790 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:31,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:59:31,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:31,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:31,807 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:53 [2021-06-05 08:59:31,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2021-06-05 08:59:31,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2021-06-05 08:59:31,908 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:31,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:31,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:59:31,927 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:66 [2021-06-05 08:59:33,282 WARN L205 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-06-05 08:59:33,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 08:59:33,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-06-05 08:59:33,439 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:33,450 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:74, output treesize:16 [2021-06-05 08:59:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:59:33,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661862019] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:59:33,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:59:33,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2021-06-05 08:59:33,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400080853] [2021-06-05 08:59:33,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:59:33,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:59:33,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:59:33,505 INFO L87 Difference]: Start difference. First operand 38984 states and 113718 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:34,680 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2021-06-05 08:59:36,276 WARN L205 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 08:59:37,269 WARN L205 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 08:59:38,199 WARN L205 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 08:59:38,730 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-06-05 08:59:39,484 WARN L205 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-06-05 08:59:40,865 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-06-05 08:59:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:41,612 INFO L93 Difference]: Finished difference Result 111389 states and 321864 transitions. [2021-06-05 08:59:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 08:59:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 08:59:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:41,777 INFO L225 Difference]: With dead ends: 111389 [2021-06-05 08:59:41,777 INFO L226 Difference]: Without dead ends: 110945 [2021-06-05 08:59:41,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 7145.7ms TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 08:59:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110945 states. [2021-06-05 08:59:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110945 to 39618. [2021-06-05 08:59:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39618 states, 39615 states have (on average 2.9207370945348985) internal successors, (115705), 39617 states have internal predecessors, (115705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39618 states to 39618 states and 115705 transitions. [2021-06-05 08:59:42,967 INFO L78 Accepts]: Start accepts. Automaton has 39618 states and 115705 transitions. Word has length 89 [2021-06-05 08:59:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:42,967 INFO L482 AbstractCegarLoop]: Abstraction has 39618 states and 115705 transitions. [2021-06-05 08:59:42,968 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:42,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39618 states and 115705 transitions. [2021-06-05 08:59:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:59:43,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:43,002 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:43,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:43,203 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash -961720300, now seen corresponding path program 3 times [2021-06-05 08:59:43,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:43,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987496034] [2021-06-05 08:59:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:43,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:43,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987496034] [2021-06-05 08:59:43,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987496034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:43,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500678990] [2021-06-05 08:59:43,326 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:43,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:59:43,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:43,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:59:43,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:43,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:43,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,483 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,484 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,484 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:59:43,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:43,510 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:59:43,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:43,546 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2021-06-05 08:59:43,647 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:43,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:59:43,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,658 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:43,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:59:43,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:43,679 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:53 [2021-06-05 08:59:43,796 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_int_98|], 4=[v_prenex_17]} [2021-06-05 08:59:43,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:59:43,803 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,873 INFO L628 ElimStorePlain]: treesize reduction 7, result has 94.0 percent of original size [2021-06-05 08:59:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 08:59:43,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-06-05 08:59:43,878 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2021-06-05 08:59:43,883 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2021-06-05 08:59:43,911 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:120, output treesize:95 [2021-06-05 08:59:44,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 08:59:44,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:44,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:44,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-06-05 08:59:44,395 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:44,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:44,404 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:44,404 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:74, output treesize:16 [2021-06-05 08:59:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:59:44,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500678990] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:59:44,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:59:44,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2021-06-05 08:59:44,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919726908] [2021-06-05 08:59:44,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:59:44,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:44,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:59:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:59:44,469 INFO L87 Difference]: Start difference. First operand 39618 states and 115705 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:46,764 INFO L93 Difference]: Finished difference Result 106183 states and 306762 transitions. [2021-06-05 08:59:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:59:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 08:59:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:46,915 INFO L225 Difference]: With dead ends: 106183 [2021-06-05 08:59:46,915 INFO L226 Difference]: Without dead ends: 105715 [2021-06-05 08:59:46,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1241.0ms TimeCoverageRelationStatistics Valid=236, Invalid=1486, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 08:59:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105715 states. [2021-06-05 08:59:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105715 to 39580. [2021-06-05 08:59:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39580 states, 39577 states have (on average 2.920686257169568) internal successors, (115592), 39579 states have internal predecessors, (115592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39580 states to 39580 states and 115592 transitions. [2021-06-05 08:59:48,041 INFO L78 Accepts]: Start accepts. Automaton has 39580 states and 115592 transitions. Word has length 89 [2021-06-05 08:59:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:48,042 INFO L482 AbstractCegarLoop]: Abstraction has 39580 states and 115592 transitions. [2021-06-05 08:59:48,042 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39580 states and 115592 transitions. [2021-06-05 08:59:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:59:48,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:48,076 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:48,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:48,277 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash 59065210, now seen corresponding path program 4 times [2021-06-05 08:59:48,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:48,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095451508] [2021-06-05 08:59:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:48,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:48,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095451508] [2021-06-05 08:59:48,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095451508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:48,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561439092] [2021-06-05 08:59:48,399 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:48,473 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:59:48,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:48,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:59:48,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:48,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:59:48,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:48,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:48,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 08:59:48,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:48,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,588 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:59:48,631 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:48,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:59:48,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:48,638 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,638 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2021-06-05 08:59:48,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:59:48,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:48,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:48,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2021-06-05 08:59:48,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:59:48,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:48,772 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:48,772 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:59:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:48,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561439092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:48,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:48,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2021-06-05 08:59:48,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101136201] [2021-06-05 08:59:48,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 08:59:48,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 08:59:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:59:48,801 INFO L87 Difference]: Start difference. First operand 39580 states and 115592 transitions. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:52,576 INFO L93 Difference]: Finished difference Result 114191 states and 329380 transitions. [2021-06-05 08:59:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-06-05 08:59:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 08:59:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:52,734 INFO L225 Difference]: With dead ends: 114191 [2021-06-05 08:59:52,734 INFO L226 Difference]: Without dead ends: 113663 [2021-06-05 08:59:52,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5468 ImplicationChecksByTransitivity, 1701.8ms TimeCoverageRelationStatistics Valid=1626, Invalid=12894, Unknown=0, NotChecked=0, Total=14520 [2021-06-05 08:59:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113663 states. [2021-06-05 08:59:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113663 to 40054. [2021-06-05 08:59:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40054 states, 40051 states have (on average 2.9201018701156025) internal successors, (116953), 40053 states have internal predecessors, (116953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40054 states to 40054 states and 116953 transitions. [2021-06-05 08:59:53,942 INFO L78 Accepts]: Start accepts. Automaton has 40054 states and 116953 transitions. Word has length 89 [2021-06-05 08:59:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:53,942 INFO L482 AbstractCegarLoop]: Abstraction has 40054 states and 116953 transitions. [2021-06-05 08:59:53,942 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 40054 states and 116953 transitions. [2021-06-05 08:59:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:59:53,977 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:53,977 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:59:54,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 08:59:54,178 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 590732317, now seen corresponding path program 1 times [2021-06-05 08:59:54,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:54,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804309655] [2021-06-05 08:59:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:54,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:54,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804309655] [2021-06-05 08:59:54,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804309655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:54,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075065744] [2021-06-05 08:59:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:54,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 08:59:54,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:54,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:59:54,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:54,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:54,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:54,541 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 08:59:54,571 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:54,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:59:54,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:54,578 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:54,580 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:54,580 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:59:54,829 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:54,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:59:54,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:54,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:59:54,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:55,095 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 08:59:55,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:55,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:55,097 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:59:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:59:55,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075065744] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:55,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:55,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2021-06-05 08:59:55,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871017116] [2021-06-05 08:59:55,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 08:59:55,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 08:59:55,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:59:55,143 INFO L87 Difference]: Start difference. First operand 40054 states and 116953 transitions. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:59:57,379 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2021-06-05 08:59:59,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:59,148 INFO L93 Difference]: Finished difference Result 89035 states and 254816 transitions. [2021-06-05 08:59:59,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-06-05 08:59:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 08:59:59,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:59,261 INFO L225 Difference]: With dead ends: 89035 [2021-06-05 08:59:59,262 INFO L226 Difference]: Without dead ends: 88471 [2021-06-05 08:59:59,263 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6738 ImplicationChecksByTransitivity, 2182.2ms TimeCoverageRelationStatistics Valid=1461, Invalid=16095, Unknown=0, NotChecked=0, Total=17556 [2021-06-05 08:59:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88471 states. [2021-06-05 09:00:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88471 to 40580. [2021-06-05 09:00:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40580 states, 40577 states have (on average 2.91872242896222) internal successors, (118433), 40579 states have internal predecessors, (118433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40580 states to 40580 states and 118433 transitions. [2021-06-05 09:00:00,253 INFO L78 Accepts]: Start accepts. Automaton has 40580 states and 118433 transitions. Word has length 89 [2021-06-05 09:00:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:00,254 INFO L482 AbstractCegarLoop]: Abstraction has 40580 states and 118433 transitions. [2021-06-05 09:00:00,254 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 40580 states and 118433 transitions. [2021-06-05 09:00:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:00,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:00,289 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:00,489 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2021-06-05 09:00:00,489 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -15054331, now seen corresponding path program 2 times [2021-06-05 09:00:00,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:00,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715833101] [2021-06-05 09:00:00,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:00,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:00,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715833101] [2021-06-05 09:00:00,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715833101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:00,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349301094] [2021-06-05 09:00:00,608 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:00,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:00:00,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:00,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:00:00,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:00,890 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-05 09:00:00,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:00:00,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:00,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:00,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:00,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:00:00,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:00,926 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:00,939 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:00,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:00:00,943 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:00,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:00,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:00,956 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2021-06-05 09:00:01,051 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:01,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:00:01,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:01,059 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,059 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2021-06-05 09:00:01,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:01,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2021-06-05 09:00:01,153 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2021-06-05 09:00:01,158 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:01,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:01,181 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:66 [2021-06-05 09:00:01,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-06-05 09:00:01,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:01,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:01,263 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:01,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:01,272 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:01,272 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:74, output treesize:16 [2021-06-05 09:00:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:00:01,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349301094] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:00:01,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:00:01,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2021-06-05 09:00:01,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855305931] [2021-06-05 09:00:01,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:00:01,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:01,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:00:01,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:00:01,319 INFO L87 Difference]: Start difference. First operand 40580 states and 118433 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:03,479 INFO L93 Difference]: Finished difference Result 108810 states and 313393 transitions. [2021-06-05 09:00:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 09:00:03,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:03,645 INFO L225 Difference]: With dead ends: 108810 [2021-06-05 09:00:03,646 INFO L226 Difference]: Without dead ends: 108366 [2021-06-05 09:00:03,646 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1106.0ms TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 09:00:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108366 states. [2021-06-05 09:00:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108366 to 42476. [2021-06-05 09:00:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42476 states, 42473 states have (on average 2.9225390247922207) internal successors, (124129), 42475 states have internal predecessors, (124129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42476 states to 42476 states and 124129 transitions. [2021-06-05 09:00:04,908 INFO L78 Accepts]: Start accepts. Automaton has 42476 states and 124129 transitions. Word has length 89 [2021-06-05 09:00:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:04,909 INFO L482 AbstractCegarLoop]: Abstraction has 42476 states and 124129 transitions. [2021-06-05 09:00:04,909 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 42476 states and 124129 transitions. [2021-06-05 09:00:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:04,944 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:04,945 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:05,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-06-05 09:00:05,145 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1580060835, now seen corresponding path program 3 times [2021-06-05 09:00:05,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:05,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956964327] [2021-06-05 09:00:05,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:05,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:05,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956964327] [2021-06-05 09:00:05,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956964327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:05,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953106257] [2021-06-05 09:00:05,269 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:05,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:00:05,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:05,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:00:05,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:05,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:00:05,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,420 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,420 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:00:05,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:05,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:00:05,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:05,472 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2021-06-05 09:00:05,540 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:05,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:00:05,541 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,548 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:05,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:00:05,549 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:05,566 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:53 [2021-06-05 09:00:05,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:05,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2021-06-05 09:00:05,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2021-06-05 09:00:05,683 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:05,709 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:66 [2021-06-05 09:00:05,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-06-05 09:00:05,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:05,792 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:05,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:05,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:05,801 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:74, output treesize:16 [2021-06-05 09:00:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:00:05,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953106257] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:00:05,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:00:05,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2021-06-05 09:00:05,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418053352] [2021-06-05 09:00:05,850 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:00:05,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:00:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:00:05,851 INFO L87 Difference]: Start difference. First operand 42476 states and 124129 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:06,358 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2021-06-05 09:00:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:08,147 INFO L93 Difference]: Finished difference Result 104090 states and 300076 transitions. [2021-06-05 09:00:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 09:00:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:08,313 INFO L225 Difference]: With dead ends: 104090 [2021-06-05 09:00:08,313 INFO L226 Difference]: Without dead ends: 103646 [2021-06-05 09:00:08,313 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1474.0ms TimeCoverageRelationStatistics Valid=264, Invalid=1628, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 09:00:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103646 states. [2021-06-05 09:00:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103646 to 42504. [2021-06-05 09:00:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42504 states, 42501 states have (on average 2.922825345285993) internal successors, (124223), 42503 states have internal predecessors, (124223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42504 states to 42504 states and 124223 transitions. [2021-06-05 09:00:09,738 INFO L78 Accepts]: Start accepts. Automaton has 42504 states and 124223 transitions. Word has length 89 [2021-06-05 09:00:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:09,738 INFO L482 AbstractCegarLoop]: Abstraction has 42504 states and 124223 transitions. [2021-06-05 09:00:09,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42504 states and 124223 transitions. [2021-06-05 09:00:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:09,775 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:09,775 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:09,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2021-06-05 09:00:09,976 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1138629347, now seen corresponding path program 4 times [2021-06-05 09:00:09,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:09,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987292547] [2021-06-05 09:00:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:10,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:10,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987292547] [2021-06-05 09:00:10,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987292547] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:10,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605746982] [2021-06-05 09:00:10,119 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:10,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:00:10,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:10,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 09:00:10,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:10,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:00:10,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:00:10,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:10,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 09:00:10,388 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:10,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:00:10,390 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,396 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2021-06-05 09:00:10,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 09:00:10,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:10,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2021-06-05 09:00:10,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:00:10,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,551 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,551 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 09:00:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:10,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605746982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:10,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:10,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2021-06-05 09:00:10,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731616489] [2021-06-05 09:00:10,585 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:00:10,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:10,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:00:10,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:00:10,586 INFO L87 Difference]: Start difference. First operand 42504 states and 124223 transitions. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:14,624 INFO L93 Difference]: Finished difference Result 102883 states and 295295 transitions. [2021-06-05 09:00:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-06-05 09:00:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:14,780 INFO L225 Difference]: With dead ends: 102883 [2021-06-05 09:00:14,780 INFO L226 Difference]: Without dead ends: 102319 [2021-06-05 09:00:14,781 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4471 ImplicationChecksByTransitivity, 1485.1ms TimeCoverageRelationStatistics Valid=1179, Invalid=11253, Unknown=0, NotChecked=0, Total=12432 [2021-06-05 09:00:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102319 states. [2021-06-05 09:00:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102319 to 42968. [2021-06-05 09:00:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42968 states, 42965 states have (on average 2.921494239497265) internal successors, (125522), 42967 states have internal predecessors, (125522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42968 states to 42968 states and 125522 transitions. [2021-06-05 09:00:16,002 INFO L78 Accepts]: Start accepts. Automaton has 42968 states and 125522 transitions. Word has length 89 [2021-06-05 09:00:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:16,003 INFO L482 AbstractCegarLoop]: Abstraction has 42968 states and 125522 transitions. [2021-06-05 09:00:16,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42968 states and 125522 transitions. [2021-06-05 09:00:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:16,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:16,043 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:16,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2021-06-05 09:00:16,243 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -290810705, now seen corresponding path program 5 times [2021-06-05 09:00:16,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:16,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172232422] [2021-06-05 09:00:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:16,354 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:16,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172232422] [2021-06-05 09:00:16,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172232422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:16,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108157328] [2021-06-05 09:00:16,354 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:16,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:00:16,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:16,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 09:00:16,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:16,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:16,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:16,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,541 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2021-06-05 09:00:16,639 INFO L354 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2021-06-05 09:00:16,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 09:00:16,641 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:16,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:16,654 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:44 [2021-06-05 09:00:16,710 INFO L354 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2021-06-05 09:00:16,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2021-06-05 09:00:16,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,721 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:16,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2021-06-05 09:00:16,722 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,733 INFO L628 ElimStorePlain]: treesize reduction 16, result has 40.7 percent of original size [2021-06-05 09:00:16,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:16,735 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:7 [2021-06-05 09:00:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:16,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108157328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:16,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:16,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2021-06-05 09:00:16,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462044859] [2021-06-05 09:00:16,767 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:00:16,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:16,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:00:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:00:16,768 INFO L87 Difference]: Start difference. First operand 42968 states and 125522 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:20,179 INFO L93 Difference]: Finished difference Result 119204 states and 343894 transitions. [2021-06-05 09:00:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-06-05 09:00:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:20,391 INFO L225 Difference]: With dead ends: 119204 [2021-06-05 09:00:20,391 INFO L226 Difference]: Without dead ends: 118676 [2021-06-05 09:00:20,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 1264.4ms TimeCoverageRelationStatistics Valid=1035, Invalid=6621, Unknown=0, NotChecked=0, Total=7656 [2021-06-05 09:00:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118676 states. [2021-06-05 09:00:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118676 to 43800. [2021-06-05 09:00:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43800 states, 43797 states have (on average 2.9183962371851955) internal successors, (127817), 43799 states have internal predecessors, (127817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43800 states to 43800 states and 127817 transitions. [2021-06-05 09:00:21,832 INFO L78 Accepts]: Start accepts. Automaton has 43800 states and 127817 transitions. Word has length 89 [2021-06-05 09:00:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:21,832 INFO L482 AbstractCegarLoop]: Abstraction has 43800 states and 127817 transitions. [2021-06-05 09:00:21,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 43800 states and 127817 transitions. [2021-06-05 09:00:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:21,866 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:21,866 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:22,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:22,068 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -751022498, now seen corresponding path program 1 times [2021-06-05 09:00:22,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:22,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929757759] [2021-06-05 09:00:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:22,171 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:22,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929757759] [2021-06-05 09:00:22,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929757759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:22,171 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938565765] [2021-06-05 09:00:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:22,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 09:00:22,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:22,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:22,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:22,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:22,327 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2021-06-05 09:00:22,504 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:00:22,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2021-06-05 09:00:22,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:22,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,519 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:23 [2021-06-05 09:00:22,554 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:00:22,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 09:00:22,555 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:22,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:22,564 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:28 [2021-06-05 09:00:22,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:00:22,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,786 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:22,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-06-05 09:00:22,787 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:22,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:22,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:22,794 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2021-06-05 09:00:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:22,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938565765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:22,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:22,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 09:00:22,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144063525] [2021-06-05 09:00:22,835 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:00:22,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:00:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:00:22,836 INFO L87 Difference]: Start difference. First operand 43800 states and 127817 transitions. Second operand has 19 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:25,102 INFO L93 Difference]: Finished difference Result 99369 states and 285903 transitions. [2021-06-05 09:00:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-05 09:00:25,103 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:25,275 INFO L225 Difference]: With dead ends: 99369 [2021-06-05 09:00:25,275 INFO L226 Difference]: Without dead ends: 98853 [2021-06-05 09:00:25,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 857.2ms TimeCoverageRelationStatistics Valid=530, Invalid=3630, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 09:00:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98853 states. [2021-06-05 09:00:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98853 to 44084. [2021-06-05 09:00:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44084 states, 44081 states have (on average 2.917470111839568) internal successors, (128605), 44083 states have internal predecessors, (128605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44084 states to 44084 states and 128605 transitions. [2021-06-05 09:00:26,784 INFO L78 Accepts]: Start accepts. Automaton has 44084 states and 128605 transitions. Word has length 89 [2021-06-05 09:00:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:26,784 INFO L482 AbstractCegarLoop]: Abstraction has 44084 states and 128605 transitions. [2021-06-05 09:00:26,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 7.0) internal successors, (133), 19 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 44084 states and 128605 transitions. [2021-06-05 09:00:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:27,130 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:27,130 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:27,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:27,331 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash -953467970, now seen corresponding path program 2 times [2021-06-05 09:00:27,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:27,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301902508] [2021-06-05 09:00:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:27,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:27,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301902508] [2021-06-05 09:00:27,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301902508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:27,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436422929] [2021-06-05 09:00:27,545 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:27,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:00:27,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:27,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:00:27,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:27,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:00:27,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:27,823 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:27,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:27,837 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:27,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:27,848 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:27,848 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2021-06-05 09:00:28,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:28,137 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-06-05 09:00:28,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 52 [2021-06-05 09:00:28,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:28,165 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-06-05 09:00:28,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 30 [2021-06-05 09:00:28,167 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:28,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:28,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:28,211 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:76 [2021-06-05 09:00:29,012 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 09:00:29,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2021-06-05 09:00:29,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:29,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:29,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:29,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 09:00:29,037 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:29,061 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-06-05 09:00:29,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2021-06-05 09:00:29,063 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:29,068 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:29,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:29,070 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:29,124 INFO L628 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2021-06-05 09:00:29,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:00:29,126 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:183, output treesize:19 [2021-06-05 09:00:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:00:29,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436422929] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:00:29,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:00:29,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2021-06-05 09:00:29,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955701918] [2021-06-05 09:00:29,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:00:29,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:00:29,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:00:29,226 INFO L87 Difference]: Start difference. First operand 44084 states and 128605 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:31,421 INFO L93 Difference]: Finished difference Result 100073 states and 289712 transitions. [2021-06-05 09:00:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 09:00:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:31,592 INFO L225 Difference]: With dead ends: 100073 [2021-06-05 09:00:31,592 INFO L226 Difference]: Without dead ends: 99677 [2021-06-05 09:00:31,592 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 91 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1357.5ms TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 09:00:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99677 states. [2021-06-05 09:00:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99677 to 45502. [2021-06-05 09:00:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45502 states, 45499 states have (on average 2.9302622035649133) internal successors, (133324), 45501 states have internal predecessors, (133324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45502 states to 45502 states and 133324 transitions. [2021-06-05 09:00:33,218 INFO L78 Accepts]: Start accepts. Automaton has 45502 states and 133324 transitions. Word has length 89 [2021-06-05 09:00:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:33,218 INFO L482 AbstractCegarLoop]: Abstraction has 45502 states and 133324 transitions. [2021-06-05 09:00:33,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45502 states and 133324 transitions. [2021-06-05 09:00:33,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:33,273 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:33,273 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:33,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable164 [2021-06-05 09:00:33,477 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash 45929148, now seen corresponding path program 3 times [2021-06-05 09:00:33,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:33,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34067643] [2021-06-05 09:00:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:33,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:33,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34067643] [2021-06-05 09:00:33,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34067643] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:33,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481329656] [2021-06-05 09:00:33,680 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:33,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:00:33,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:33,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:00:33,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:33,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:33,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:33,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:33,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:00:33,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:33,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:33,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:00:33,890 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2021-06-05 09:00:34,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:34,097 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-06-05 09:00:34,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 52 [2021-06-05 09:00:34,099 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,117 INFO L354 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2021-06-05 09:00:34,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 30 [2021-06-05 09:00:34,118 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:34,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:34,148 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:76 [2021-06-05 09:00:34,588 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 09:00:34,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2021-06-05 09:00:34,590 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,596 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:34,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:34,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:00:34,602 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 09:00:34,606 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,612 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 09:00:34,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2021-06-05 09:00:34,613 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:34,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:34,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:00:34,632 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:183, output treesize:19 [2021-06-05 09:00:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 09:00:34,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481329656] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:00:34,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:00:34,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2021-06-05 09:00:34,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264155761] [2021-06-05 09:00:34,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:00:34,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:00:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:00:34,685 INFO L87 Difference]: Start difference. First operand 45502 states and 133324 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:36,193 INFO L93 Difference]: Finished difference Result 97931 states and 283454 transitions. [2021-06-05 09:00:36,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 09:00:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:36,334 INFO L225 Difference]: With dead ends: 97931 [2021-06-05 09:00:36,335 INFO L226 Difference]: Without dead ends: 97535 [2021-06-05 09:00:36,335 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 898.3ms TimeCoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 09:00:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97535 states. [2021-06-05 09:00:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97535 to 45524. [2021-06-05 09:00:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45524 states, 45521 states have (on average 2.930581489861822) internal successors, (133403), 45523 states have internal predecessors, (133403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45524 states to 45524 states and 133403 transitions. [2021-06-05 09:00:37,769 INFO L78 Accepts]: Start accepts. Automaton has 45524 states and 133403 transitions. Word has length 89 [2021-06-05 09:00:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:37,769 INFO L482 AbstractCegarLoop]: Abstraction has 45524 states and 133403 transitions. [2021-06-05 09:00:37,769 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 45524 states and 133403 transitions. [2021-06-05 09:00:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 09:00:37,809 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:37,809 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:38,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable201 [2021-06-05 09:00:38,010 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:38,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1529537024, now seen corresponding path program 4 times [2021-06-05 09:00:38,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:38,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571279002] [2021-06-05 09:00:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:38,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:38,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571279002] [2021-06-05 09:00:38,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571279002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:38,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439770051] [2021-06-05 09:00:38,113 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:38,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:00:38,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:38,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 09:00:38,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:38,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:00:38,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:38,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:38,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:38,247 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:13 [2021-06-05 09:00:38,615 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:00:38,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-06-05 09:00:38,617 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:38,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:38,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:38,642 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2021-06-05 09:00:38,730 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:00:38,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 34 [2021-06-05 09:00:38,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:38,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:38,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:38,744 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:31 [2021-06-05 09:00:44,004 INFO L354 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2021-06-05 09:00:44,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 09:00:44,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:44,011 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:44,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 09:00:44,013 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:44,020 INFO L628 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2021-06-05 09:00:44,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:44,021 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2021-06-05 09:00:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:00:44,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439770051] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:44,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:44,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 09:00:44,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045708154] [2021-06-05 09:00:44,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 09:00:44,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 09:00:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:00:44,049 INFO L87 Difference]: Start difference. First operand 45524 states and 133403 transitions. Second operand has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:47,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:47,056 INFO L93 Difference]: Finished difference Result 123512 states and 356697 transitions. [2021-06-05 09:00:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-06-05 09:00:47,057 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-06-05 09:00:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:47,252 INFO L225 Difference]: With dead ends: 123512 [2021-06-05 09:00:47,253 INFO L226 Difference]: Without dead ends: 122972 [2021-06-05 09:00:47,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 6256.3ms TimeCoverageRelationStatistics Valid=1194, Invalid=7736, Unknown=0, NotChecked=0, Total=8930 [2021-06-05 09:00:47,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122972 states. [2021-06-05 09:00:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122972 to 43002. [2021-06-05 09:00:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43002 states, 42999 states have (on average 2.9312077025047096) internal successors, (126039), 43001 states have internal predecessors, (126039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43002 states to 43002 states and 126039 transitions. [2021-06-05 09:00:48,638 INFO L78 Accepts]: Start accepts. Automaton has 43002 states and 126039 transitions. Word has length 89 [2021-06-05 09:00:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:48,639 INFO L482 AbstractCegarLoop]: Abstraction has 43002 states and 126039 transitions. [2021-06-05 09:00:48,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 6.65) internal successors, (133), 20 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:00:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 43002 states and 126039 transitions. [2021-06-05 09:00:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:00:48,676 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:48,676 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:00:48,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable238 [2021-06-05 09:00:48,876 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash -942028246, now seen corresponding path program 5 times [2021-06-05 09:00:48,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:48,877 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253049531] [2021-06-05 09:00:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:49,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:49,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253049531] [2021-06-05 09:00:49,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253049531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:49,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121893546] [2021-06-05 09:00:49,089 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:00:49,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:00:49,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:49,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 09:00:49,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:49,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:00:49,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:49,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:00:49,228 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:00:49,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 09:00:49,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:49,234 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,234 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 09:00:49,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:00:49,258 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:49,264 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,264 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 09:00:49,315 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-06-05 09:00:49,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:00:49,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:49,334 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:49,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2021-06-05 09:00:49,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:00:49,842 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:00:49,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:00:49,843 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,856 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-06-05 09:00:49,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:00:49,857 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:49,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:49,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:49,881 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2021-06-05 09:00:50,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:00:50,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:50,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:00:50,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:50,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:50,076 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:72 [2021-06-05 09:00:50,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,222 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:00:50,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 09:00:50,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 09:00:50,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:50,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:50,267 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:76 [2021-06-05 09:00:50,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,746 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-06-05 09:00:50,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 09:00:50,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,772 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:00:50,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:00:50,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:00:50,788 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-06-05 09:00:50,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2021-06-05 09:00:50,790 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,854 INFO L628 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2021-06-05 09:00:50,856 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2021-06-05 09:00:50,856 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:114, output treesize:84 [2021-06-05 09:00:50,943 INFO L446 ElimStorePlain]: Different costs {2=[v_prenex_39], 6=[|v_#memory_int_128|, v_prenex_42]} [2021-06-05 09:00:50,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:00:50,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:50,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:50,999 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:00:51,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:00:51,001 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:51,050 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:00:51,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:00:51,052 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:51,108 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2021-06-05 09:00:51,108 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:108, output treesize:108 [2021-06-05 09:00:51,362 INFO L354 Elim1Store]: treesize reduction 59, result has 44.3 percent of original size [2021-06-05 09:00:51,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 63 [2021-06-05 09:00:51,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,386 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:00:51,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:00:51,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 09:00:51,397 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,419 INFO L354 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2021-06-05 09:00:51,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 46 [2021-06-05 09:00:51,420 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,436 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:00:51,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 09:00:51,437 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,561 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2021-06-05 09:00:51,561 INFO L628 ElimStorePlain]: treesize reduction 13, result has 94.2 percent of original size [2021-06-05 09:00:51,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2021-06-05 09:00:51,588 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:200, output treesize:52 [2021-06-05 09:00:51,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:00:51,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:51,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:51,632 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 09:00:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:00:51,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121893546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:51,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:51,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2021-06-05 09:00:51,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536760510] [2021-06-05 09:00:51,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 09:00:51,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:51,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 09:00:51,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2021-06-05 09:00:51,674 INFO L87 Difference]: Start difference. First operand 43002 states and 126039 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:01:37,337 INFO L93 Difference]: Finished difference Result 107957 states and 310384 transitions. [2021-06-05 09:01:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-06-05 09:01:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:01:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:01:37,633 INFO L225 Difference]: With dead ends: 107957 [2021-06-05 09:01:37,633 INFO L226 Difference]: Without dead ends: 107237 [2021-06-05 09:01:37,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 65 SyntacticMatches, 20 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5002 ImplicationChecksByTransitivity, 4200.1ms TimeCoverageRelationStatistics Valid=1694, Invalid=12112, Unknown=0, NotChecked=0, Total=13806 [2021-06-05 09:01:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107237 states. [2021-06-05 09:01:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107237 to 44718. [2021-06-05 09:01:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44718 states, 44715 states have (on average 2.930358939953036) internal successors, (131031), 44717 states have internal predecessors, (131031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44718 states to 44718 states and 131031 transitions. [2021-06-05 09:01:38,905 INFO L78 Accepts]: Start accepts. Automaton has 44718 states and 131031 transitions. Word has length 95 [2021-06-05 09:01:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:01:38,905 INFO L482 AbstractCegarLoop]: Abstraction has 44718 states and 131031 transitions. [2021-06-05 09:01:38,905 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 30 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 44718 states and 131031 transitions. [2021-06-05 09:01:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:01:38,939 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:01:38,939 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:01:39,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:01:39,140 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:01:39,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:01:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1415566523, now seen corresponding path program 6 times [2021-06-05 09:01:39,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:01:39,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774699281] [2021-06-05 09:01:39,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:01:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:01:39,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:01:39,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774699281] [2021-06-05 09:01:39,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774699281] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:39,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393546397] [2021-06-05 09:01:39,343 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:01:39,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:01:39,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:01:39,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-05 09:01:39,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:01:39,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:01:39,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,445 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:01:39,485 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:01:39,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:01:39,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,491 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:01:39,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:01:39,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,541 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:01:39,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:39,542 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:01:39,581 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:01:39,582 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:01:39,584 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:01:39,606 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:01:39,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:01:39,608 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:39,618 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2021-06-05 09:01:39,719 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:01:39,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:01:39,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,726 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 09:01:39,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-06-05 09:01:39,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,813 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2021-06-05 09:01:39,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-06-05 09:01:39,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:39,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:39,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2021-06-05 09:01:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:01:39,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393546397] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:39,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:01:39,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2021-06-05 09:01:39,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438088147] [2021-06-05 09:01:39,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:01:39,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:01:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:01:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:01:39,830 INFO L87 Difference]: Start difference. First operand 44718 states and 131031 transitions. Second operand has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:01:45,605 INFO L93 Difference]: Finished difference Result 144160 states and 409914 transitions. [2021-06-05 09:01:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-06-05 09:01:45,605 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:01:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:01:45,803 INFO L225 Difference]: With dead ends: 144160 [2021-06-05 09:01:45,803 INFO L226 Difference]: Without dead ends: 139594 [2021-06-05 09:01:45,805 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11873 ImplicationChecksByTransitivity, 3238.6ms TimeCoverageRelationStatistics Valid=3105, Invalid=25965, Unknown=0, NotChecked=0, Total=29070 [2021-06-05 09:01:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139594 states. [2021-06-05 09:01:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139594 to 62296. [2021-06-05 09:01:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62296 states, 62293 states have (on average 2.954457162120945) internal successors, (184042), 62295 states have internal predecessors, (184042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62296 states to 62296 states and 184042 transitions. [2021-06-05 09:01:47,724 INFO L78 Accepts]: Start accepts. Automaton has 62296 states and 184042 transitions. Word has length 95 [2021-06-05 09:01:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:01:47,725 INFO L482 AbstractCegarLoop]: Abstraction has 62296 states and 184042 transitions. [2021-06-05 09:01:47,725 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.0) internal successors, (168), 24 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:01:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62296 states and 184042 transitions. [2021-06-05 09:01:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:01:47,761 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:01:47,761 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:01:47,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable304 [2021-06-05 09:01:47,962 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:01:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:01:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1837128020, now seen corresponding path program 6 times [2021-06-05 09:01:47,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:01:47,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965238007] [2021-06-05 09:01:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:01:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:01:48,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:01:48,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965238007] [2021-06-05 09:01:48,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965238007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:48,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110856223] [2021-06-05 09:01:48,379 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:01:48,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:01:48,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:01:48,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 09:01:48,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:01:48,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:01:48,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:48,520 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,521 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:01:48,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:01:48,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:48,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,618 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2021-06-05 09:01:48,707 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:01:48,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:01:48,709 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:48,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,715 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2021-06-05 09:01:48,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-06-05 09:01:48,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:48,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:48,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:48,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2021-06-05 09:01:49,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:01:49,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:01:49,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:49,204 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:49,204 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:37 [2021-06-05 09:01:49,261 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:49,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2021-06-05 09:01:49,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 09:01:49,305 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2021-06-05 09:01:49,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,309 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:31 [2021-06-05 09:01:49,396 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:01:49,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:01:49,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,404 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:01:49,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:01:49,405 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:49,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:01:49,421 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:36 [2021-06-05 09:01:49,471 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 09:01:49,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,474 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 09:01:49,474 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,516 INFO L628 ElimStorePlain]: treesize reduction 6, result has 91.2 percent of original size [2021-06-05 09:01:49,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:01:49,520 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:01:49,524 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:49,545 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:01:49,545 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:54 [2021-06-05 09:01:49,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 09:01:49,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2021-06-05 09:01:49,730 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2021-06-05 09:01:49,734 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:49,760 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 09:01:49,760 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:86 [2021-06-05 09:01:49,962 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:01:49,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2021-06-05 09:01:49,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:49,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:50,015 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:01:50,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2021-06-05 09:01:50,020 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:50,096 INFO L628 ElimStorePlain]: treesize reduction 9, result has 93.6 percent of original size [2021-06-05 09:01:50,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 09:01:50,164 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:102, output treesize:88 [2021-06-05 09:02:00,848 WARN L205 SmtUtils]: Spent 6.55 s on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 09:02:00,979 INFO L446 ElimStorePlain]: Different costs {0=[|#memory_int|], 17=[v_prenex_53]} [2021-06-05 09:02:00,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-06-05 09:02:00,984 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:01,015 INFO L628 ElimStorePlain]: treesize reduction 81, result has 34.7 percent of original size [2021-06-05 09:02:01,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 09:02:01,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:01,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:01,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:02:01,027 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:139, output treesize:12 [2021-06-05 09:02:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:02:01,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110856223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:02:01,037 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:02:01,037 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 40 [2021-06-05 09:02:01,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787252389] [2021-06-05 09:02:01,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-06-05 09:02:01,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:02:01,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-06-05 09:02:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1409, Unknown=2, NotChecked=0, Total=1560 [2021-06-05 09:02:01,038 INFO L87 Difference]: Start difference. First operand 62296 states and 184042 transitions. Second operand has 40 states, 40 states have (on average 4.375) internal successors, (175), 40 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:02:13,470 WARN L205 SmtUtils]: Spent 12.09 s on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2021-06-05 09:02:31,526 WARN L205 SmtUtils]: Spent 17.93 s on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 09:02:48,358 WARN L205 SmtUtils]: Spent 16.80 s on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2021-06-05 09:02:52,469 WARN L205 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-06-05 09:03:11,475 WARN L205 SmtUtils]: Spent 18.90 s on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-06-05 09:03:26,865 WARN L205 SmtUtils]: Spent 15.24 s on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2021-06-05 09:03:39,774 WARN L205 SmtUtils]: Spent 12.74 s on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 09:05:22,364 WARN L205 SmtUtils]: Spent 19.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-05 09:05:58,850 WARN L205 SmtUtils]: Spent 16.22 s on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2021-06-05 09:06:22,246 WARN L205 SmtUtils]: Spent 19.36 s on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-06-05 09:06:44,912 WARN L205 SmtUtils]: Spent 20.61 s on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 09:07:22,470 WARN L205 SmtUtils]: Spent 17.11 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-06-05 09:07:38,730 WARN L205 SmtUtils]: Spent 16.24 s on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-06-05 09:07:48,874 WARN L205 SmtUtils]: Spent 10.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 09:08:13,456 WARN L205 SmtUtils]: Spent 16.17 s on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2021-06-05 09:08:55,044 WARN L205 SmtUtils]: Spent 21.47 s on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-06-05 09:09:35,491 WARN L205 SmtUtils]: Spent 18.07 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2021-06-05 09:09:53,583 WARN L205 SmtUtils]: Spent 18.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2021-06-05 09:10:36,420 WARN L205 SmtUtils]: Spent 16.14 s on a formula simplification. DAG size of input: 92 DAG size of output: 76 Received shutdown request... [2021-06-05 09:11:28,000 WARN L222 SmtUtils]: Removed 8 from assertion stack [2021-06-05 09:11:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-06-05 09:11:28,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable305 [2021-06-05 09:11:28,201 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:11:28,201 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 09:11:28,202 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:11:28,202 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:11:28,202 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:11:28,202 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:11:28,202 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:11:28,202 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:11:28,202 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:11:28,202 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:11:28,203 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:11:28,204 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 115 transitions, 242 flow [2021-06-05 09:11:28,204 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:11:28,204 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 09:11:28,204 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 09:11:28,206 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 09:11:28,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:11:28 BasicIcfg [2021-06-05 09:11:28,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:11:28,207 INFO L168 Benchmark]: Toolchain (without parser) took 828119.13 ms. Allocated memory was 352.3 MB in the beginning and 13.3 GB in the end (delta: 13.0 GB). Free memory was 315.4 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,207 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory was 333.5 MB in the beginning and 333.4 MB in the end (delta: 125.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.58 ms. Allocated memory is still 352.3 MB. Free memory was 315.3 MB in the beginning and 314.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.11 ms. Allocated memory is still 352.3 MB. Free memory was 314.2 MB in the beginning and 312.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 352.3 MB. Free memory was 312.1 MB in the beginning and 311.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L168 Benchmark]: RCFGBuilder took 642.50 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 275.4 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L168 Benchmark]: TraceAbstraction took 826840.74 ms. Allocated memory was 352.3 MB in the beginning and 13.3 GB in the end (delta: 13.0 GB). Free memory was 274.3 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 09:11:28,208 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 352.3 MB. Free memory was 333.5 MB in the beginning and 333.4 MB in the end (delta: 125.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 555.58 ms. Allocated memory is still 352.3 MB. Free memory was 315.3 MB in the beginning and 314.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.11 ms. Allocated memory is still 352.3 MB. Free memory was 314.2 MB in the beginning and 312.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 352.3 MB. Free memory was 312.1 MB in the beginning and 311.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 642.50 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 275.4 MB in the end (delta: 35.7 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 826840.74 ms. Allocated memory was 352.3 MB in the beginning and 13.3 GB in the end (delta: 13.0 GB). Free memory was 274.3 MB in the beginning and 11.6 GB in the end (delta: -11.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (62296states) and FLOYD_HOARE automaton (currently 80 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 93 for 6061ms.. - TimeoutResultAtElement [Line: 728]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 109 places, 115 transitions, 242 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 105 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14202.9ms, OverallIterations: 7, TraceHistogramMax: 4, EmptinessCheckTime: 30.1ms, AutomataDifference: 6004.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 826 SDtfs, 2533 SDslu, 8829 SDs, 0 SdLazy, 3464 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1973.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 340 SyntacticMatches, 6 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3271 ImplicationChecksByTransitivity, 5642.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=6, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 112.7ms AutomataMinimizationTime, 7 MinimizatonAttempts, 912 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 114.7ms SsaConstructionTime, 341.4ms SatisfiabilityAnalysisTime, 6334.0ms InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 856 ConstructedInterpolants, 144 QuantifiedInterpolants, 11445 SizeOfPredicates, 76 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 28/556 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 144 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 812411.6ms, OverallIterations: 41, TraceHistogramMax: 3, EmptinessCheckTime: 1411.4ms, AutomataDifference: 714241.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1250.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 20799 SDtfs, 50586 SDslu, 187558 SDs, 0 SdLazy, 76539 SolverSat, 4296 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 212641.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5166 GetRequests, 2489 SyntacticMatches, 93 SemanticMatches, 2583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84070 ImplicationChecksByTransitivity, 492958.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=62296occurred in iteration=40, InterpolantAutomatonStates: 2295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 41364.7ms AutomataMinimizationTime, 40 MinimizatonAttempts, 1894455 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 583.3ms SsaConstructionTime, 1031.8ms SatisfiabilityAnalysisTime, 44110.4ms InterpolantComputationTime, 5700 NumberOfCodeBlocks, 5390 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 5626 ConstructedInterpolants, 433 QuantifiedInterpolants, 57116 SizeOfPredicates, 510 NumberOfNonLiveVariables, 6114 ConjunctsInSsa, 963 ConjunctsInUnsatCore, 74 InterpolantComputations, 15 PerfectInterpolantSequences, 503/1219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 105 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 51.4ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 1.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9ms SsaConstructionTime, 3.4ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 144 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 2.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown