/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 14:29:42,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 14:29:42,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 14:29:42,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 14:29:42,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 14:29:42,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 14:29:42,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 14:29:42,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 14:29:42,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 14:29:42,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 14:29:42,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 14:29:42,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 14:29:42,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 14:29:42,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 14:29:42,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 14:29:42,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 14:29:42,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 14:29:42,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 14:29:42,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 14:29:42,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 14:29:42,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 14:29:42,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 14:29:42,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 14:29:42,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 14:29:42,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 14:29:42,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 14:29:42,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 14:29:42,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 14:29:42,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 14:29:42,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 14:29:42,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 14:29:42,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 14:29:42,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 14:29:42,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 14:29:42,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 14:29:42,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 14:29:42,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 14:29:42,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 14:29:42,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 14:29:42,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 14:29:42,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 14:29:42,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 14:29:42,843 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 14:29:42,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 14:29:42,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 14:29:42,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 14:29:42,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 14:29:42,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 14:29:42,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 14:29:42,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 14:29:42,847 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 14:29:42,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 14:29:42,848 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 14:29:42,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 14:29:42,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 14:29:42,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 14:29:42,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 14:29:42,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 14:29:42,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:29:42,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 14:29:42,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 14:29:42,851 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 14:29:42,851 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 14:29:43,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 14:29:43,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 14:29:43,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 14:29:43,052 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 14:29:43,053 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 14:29:43,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-04 14:29:43,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291b3b8bb/a81d15eca1f64d26abbb79081b898cd5/FLAG8d2df84c1 [2023-05-04 14:29:43,546 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 14:29:43,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-05-04 14:29:43,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291b3b8bb/a81d15eca1f64d26abbb79081b898cd5/FLAG8d2df84c1 [2023-05-04 14:29:43,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291b3b8bb/a81d15eca1f64d26abbb79081b898cd5 [2023-05-04 14:29:43,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 14:29:43,571 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 14:29:43,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 14:29:43,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 14:29:43,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 14:29:43,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:29:43" (1/1) ... [2023-05-04 14:29:43,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee4b437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:43, skipping insertion in model container [2023-05-04 14:29:43,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 02:29:43" (1/1) ... [2023-05-04 14:29:43,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 14:29:43,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 14:29:43,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-05-04 14:29:43,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:29:43,977 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 14:29:44,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-05-04 14:29:44,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 14:29:44,042 INFO L208 MainTranslator]: Completed translation [2023-05-04 14:29:44,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44 WrapperNode [2023-05-04 14:29:44,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 14:29:44,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 14:29:44,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 14:29:44,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 14:29:44,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,091 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2023-05-04 14:29:44,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 14:29:44,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 14:29:44,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 14:29:44,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 14:29:44,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,119 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 14:29:44,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 14:29:44,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 14:29:44,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 14:29:44,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (1/1) ... [2023-05-04 14:29:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 14:29:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:44,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 14:29:44,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 14:29:44,169 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 14:29:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 14:29:44,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 14:29:44,170 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 14:29:44,249 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 14:29:44,250 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 14:29:44,504 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 14:29:44,510 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 14:29:44,511 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2023-05-04 14:29:44,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:29:44 BoogieIcfgContainer [2023-05-04 14:29:44,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 14:29:44,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 14:29:44,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 14:29:44,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 14:29:44,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 02:29:43" (1/3) ... [2023-05-04 14:29:44,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1529d919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:29:44, skipping insertion in model container [2023-05-04 14:29:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 02:29:44" (2/3) ... [2023-05-04 14:29:44,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1529d919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 02:29:44, skipping insertion in model container [2023-05-04 14:29:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 02:29:44" (3/3) ... [2023-05-04 14:29:44,521 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-05-04 14:29:44,527 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 14:29:44,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 14:29:44,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 14:29:44,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 14:29:44,614 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 14:29:44,644 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:29:44,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:29:44,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:44,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 14:29:44,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 14:29:44,695 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:29:44,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 14:29:44,722 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b7aebac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:29:44,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 14:29:44,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -798104016, now seen corresponding path program 1 times [2023-05-04 14:29:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074527320] [2023-05-04 14:29:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:44,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074527320] [2023-05-04 14:29:45,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074527320] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:29:45,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:29:45,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:29:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992420754] [2023-05-04 14:29:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:29:45,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:29:45,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:45,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:29:45,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:29:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:45,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:45,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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) [2023-05-04 14:29:45,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:45,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 14:29:45,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:45,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:45,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1021622218, now seen corresponding path program 1 times [2023-05-04 14:29:45,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819064158] [2023-05-04 14:29:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819064158] [2023-05-04 14:29:45,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819064158] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:29:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444138549] [2023-05-04 14:29:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:45,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:29:45,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 14:29:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:45,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 14:29:45,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:29:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:45,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:29:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:45,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444138549] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:29:45,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:29:45,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 14:29:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938035681] [2023-05-04 14:29:45,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:29:45,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 14:29:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 14:29:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 14:29:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:45,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:45,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 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) [2023-05-04 14:29:45,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:45,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:45,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:45,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 14:29:46,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 14:29:46,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1667845354, now seen corresponding path program 2 times [2023-05-04 14:29:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:46,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828650516] [2023-05-04 14:29:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:46,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:29:46,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:46,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828650516] [2023-05-04 14:29:46,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828650516] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:29:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643166210] [2023-05-04 14:29:46,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:29:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:46,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:29:46,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 14:29:46,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 14:29:46,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:29:46,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 14:29:46,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:29:46,481 INFO L390 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 [2023-05-04 14:29:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-04 14:29:46,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 14:29:46,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643166210] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:29:46,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 14:29:46,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 14:29:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882668515] [2023-05-04 14:29:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:29:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:29:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:29:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 14:29:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:46,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:46,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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) [2023-05-04 14:29:46,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:46,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:46,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:46,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:46,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-04 14:29:46,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:46,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:46,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash -597954122, now seen corresponding path program 1 times [2023-05-04 14:29:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:46,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797968244] [2023-05-04 14:29:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:29:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:46,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797968244] [2023-05-04 14:29:46,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797968244] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:29:46,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625188344] [2023-05-04 14:29:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:46,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:46,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:46,956 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:29:46,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 14:29:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:47,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 14:29:47,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:29:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:47,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:29:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:29:47,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625188344] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:29:47,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:29:47,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 14:29:47,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623079049] [2023-05-04 14:29:47,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:29:47,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 14:29:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 14:29:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 14:29:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:47,222 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:47,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 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) [2023-05-04 14:29:47,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:47,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:47,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:47,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:29:47,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 14:29:47,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:47,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:47,640 INFO L85 PathProgramCache]: Analyzing trace with hash -485027827, now seen corresponding path program 1 times [2023-05-04 14:29:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:47,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632217963] [2023-05-04 14:29:47,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:29:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:47,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632217963] [2023-05-04 14:29:47,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632217963] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:29:47,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533386262] [2023-05-04 14:29:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:47,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:29:47,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 14:29:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:47,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 14:29:47,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:29:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:29:48,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:29:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:29:48,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533386262] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:29:48,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:29:48,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 14:29:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918055624] [2023-05-04 14:29:48,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:29:48,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 14:29:48,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 14:29:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 14:29:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:48,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:48,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 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) [2023-05-04 14:29:48,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:48,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:48,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:48,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:29:48,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:29:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:29:48,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 14:29:48,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:48,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:29:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:29:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 142744920, now seen corresponding path program 2 times [2023-05-04 14:29:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:29:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589998834] [2023-05-04 14:29:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:29:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:29:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:29:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:29:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:29:49,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589998834] [2023-05-04 14:29:49,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589998834] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:29:49,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185815614] [2023-05-04 14:29:49,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:29:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:29:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:29:49,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:29:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 14:29:49,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:29:49,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:29:49,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-04 14:29:49,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:29:49,180 INFO L390 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 7 treesize of output 6 [2023-05-04 14:29:49,542 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:29:49,542 INFO L390 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 [2023-05-04 14:29:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:29:49,583 INFO L390 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 13 treesize of output 15 [2023-05-04 14:29:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:29:49,703 INFO L390 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 13 treesize of output 15 [2023-05-04 14:29:49,763 INFO L390 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 14 treesize of output 10 [2023-05-04 14:29:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:29:49,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:29:51,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_284) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:29:51,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_284) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:29:52,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:29:52,472 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:29:52,473 INFO L390 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 13 treesize of output 12 [2023-05-04 14:29:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 2 not checked. [2023-05-04 14:29:52,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185815614] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:29:52,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:29:52,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2023-05-04 14:29:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969683081] [2023-05-04 14:29:52,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:29:52,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-05-04 14:29:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:29:52,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-05-04 14:29:52,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=289, Unknown=3, NotChecked=70, Total=420 [2023-05-04 14:29:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:29:52,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:29:52,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.80952380952381) internal successors, (185), 21 states have internal predecessors, (185), 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) [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:29:52,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:30:10,549 WARN L233 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 24 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:30:34,609 WARN L233 SmtUtils]: Spent 24.05s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:30:52,674 WARN L233 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 25 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:30:52,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 14:30:52,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 14:30:53,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:30:53,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:30:53,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:30:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1543925570, now seen corresponding path program 3 times [2023-05-04 14:30:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:30:53,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520042317] [2023-05-04 14:30:53,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:30:53,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:30:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:30:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:30:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:30:53,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520042317] [2023-05-04 14:30:53,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520042317] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:30:53,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435362674] [2023-05-04 14:30:53,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 14:30:53,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:30:53,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:30:53,534 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:30:53,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 14:30:53,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 14:30:53,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:30:53,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 24 conjunts are in the unsatisfiable core [2023-05-04 14:30:53,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:30:53,628 INFO L390 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 7 treesize of output 6 [2023-05-04 14:30:54,030 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:30:54,031 INFO L390 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 [2023-05-04 14:30:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:30:54,073 INFO L390 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 13 treesize of output 15 [2023-05-04 14:30:54,275 INFO L390 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 14 treesize of output 10 [2023-05-04 14:30:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 14:30:54,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:30:56,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_348) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:30:56,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:30:56,785 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:30:56,785 INFO L390 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 13 treesize of output 12 [2023-05-04 14:30:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2023-05-04 14:30:56,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435362674] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:30:56,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:30:56,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 24 [2023-05-04 14:30:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356350515] [2023-05-04 14:30:56,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:30:56,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 14:30:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:30:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 14:30:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=422, Unknown=2, NotChecked=42, Total=552 [2023-05-04 14:30:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:30:56,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:30:56,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 24 states have internal predecessors, (188), 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) [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 14:30:56,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:10,861 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 24 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 14:31:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 14:31:11,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 14:31:11,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:11,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:11,527 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-05-04 14:31:11,528 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-05-04 14:31:11,530 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:31:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:31:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:11,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 14:31:11,539 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:31:11,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 14:31:11,540 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b7aebac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:31:11,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-04 14:31:11,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-05-04 14:31:11,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 14:31:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash 319883523, now seen corresponding path program 1 times [2023-05-04 14:31:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:11,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403850265] [2023-05-04 14:31:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:31:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403850265] [2023-05-04 14:31:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403850265] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:31:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:31:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:31:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368514845] [2023-05-04 14:31:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:31:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:31:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:31:11,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:31:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:11,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:11,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2023-05-04 14:31:11,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 14:31:11,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 14:31:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 717239874, now seen corresponding path program 1 times [2023-05-04 14:31:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:11,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281922747] [2023-05-04 14:31:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:11,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281922747] [2023-05-04 14:31:11,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281922747] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:11,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439486633] [2023-05-04 14:31:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:11,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:11,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:11,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 14:31:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:11,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 14:31:11,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:11,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:11,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439486633] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:11,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:11,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 14:31:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592434840] [2023-05-04 14:31:11,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:11,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 14:31:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 14:31:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 14:31:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:11,861 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:11,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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) [2023-05-04 14:31:11,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:11,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:11,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-05-04 14:31:12,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:12,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 14:31:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 170741602, now seen corresponding path program 2 times [2023-05-04 14:31:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:12,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978298326] [2023-05-04 14:31:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:31:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978298326] [2023-05-04 14:31:12,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978298326] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:12,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365965014] [2023-05-04 14:31:12,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:31:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:12,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:12,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 14:31:12,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:31:12,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:31:12,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 14:31:12,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:12,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365965014] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:12,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:12,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 14:31:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933371966] [2023-05-04 14:31:12,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:12,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 14:31:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 14:31:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 14:31:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:12,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:12,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 19 states have internal predecessors, (137), 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) [2023-05-04 14:31:12,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:12,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:12,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:31:12,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:12,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 14:31:12,820 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 14:31:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1864221798, now seen corresponding path program 1 times [2023-05-04 14:31:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:12,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149330110] [2023-05-04 14:31:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:31:13,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:13,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149330110] [2023-05-04 14:31:13,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149330110] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:13,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495472150] [2023-05-04 14:31:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:13,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:13,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:13,042 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:13,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 14:31:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:13,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 14:31:13,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:31:13,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 14:31:13,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495472150] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:13,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:13,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 14:31:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609237440] [2023-05-04 14:31:13,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:13,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 14:31:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 14:31:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 14:31:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:13,358 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:13,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 23 states have internal predecessors, (107), 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) [2023-05-04 14:31:13,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:13,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:13,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:31:13,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:31:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:13,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-04 14:31:13,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 14:31:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1629621201, now seen corresponding path program 2 times [2023-05-04 14:31:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322620914] [2023-05-04 14:31:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 14:31:13,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 14:31:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 14:31:13,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 14:31:13,841 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 14:31:13,841 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-04 14:31:13,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-04 14:31:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 14:31:13,844 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2023-05-04 14:31:13,844 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-05-04 14:31:13,845 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 14:31:13,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 14:31:13,871 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 14:31:13,874 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:31:13,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 14:31:13,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:13,881 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 14:31:13,885 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 14:31:13,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-05-04 14:31:13,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b7aebac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 14:31:13,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 14:31:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2023-05-04 14:31:13,959 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:13,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 132292841, now seen corresponding path program 1 times [2023-05-04 14:31:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:13,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234670004] [2023-05-04 14:31:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:13,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:13,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234670004] [2023-05-04 14:31:13,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234670004] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:31:13,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 14:31:13,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 14:31:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898939449] [2023-05-04 14:31:13,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:31:13,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:31:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:31:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 14:31:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:13,981 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:13,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2023-05-04 14:31:13,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 14:31:14,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1708156881, now seen corresponding path program 1 times [2023-05-04 14:31:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:14,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695568119] [2023-05-04 14:31:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:14,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:14,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695568119] [2023-05-04 14:31:14,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695568119] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:14,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108295126] [2023-05-04 14:31:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:14,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:14,148 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:14,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-04 14:31:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 14:31:14,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:14,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 14:31:14,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108295126] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:14,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:14,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 14:31:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027124599] [2023-05-04 14:31:14,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:14,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 14:31:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 14:31:14,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 14:31:14,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:14,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:14,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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) [2023-05-04 14:31:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:14,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:14,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-04 14:31:14,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:14,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1289210577, now seen corresponding path program 2 times [2023-05-04 14:31:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:14,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053970382] [2023-05-04 14:31:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:31:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:14,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053970382] [2023-05-04 14:31:14,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053970382] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:14,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315919818] [2023-05-04 14:31:14,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:31:14,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:14,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:14,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:14,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-04 14:31:14,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 14:31:14,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:31:14,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 14:31:14,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:14,739 INFO L390 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 [2023-05-04 14:31:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-04 14:31:14,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 14:31:14,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315919818] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 14:31:14,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 14:31:14,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 14:31:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245433670] [2023-05-04 14:31:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 14:31:14,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 14:31:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 14:31:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 14:31:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:14,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2023-05-04 14:31:14,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:14,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:14,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:14,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:15,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -880378179, now seen corresponding path program 3 times [2023-05-04 14:31:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972866032] [2023-05-04 14:31:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:31:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:15,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972866032] [2023-05-04 14:31:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972866032] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570741544] [2023-05-04 14:31:15,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 14:31:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:15,074 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:15,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-04 14:31:15,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 14:31:15,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:31:15,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 14:31:15,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:31:15,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 14:31:15,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570741544] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:15,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:15,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 14:31:15,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070805209] [2023-05-04 14:31:15,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 14:31:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 14:31:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 14:31:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:15,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:15,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 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) [2023-05-04 14:31:15,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:15,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:15,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:15,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:16,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 14:31:16,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:16,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1657670219, now seen corresponding path program 1 times [2023-05-04 14:31:16,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:16,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295741240] [2023-05-04 14:31:16,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295741240] [2023-05-04 14:31:16,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295741240] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945007170] [2023-05-04 14:31:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:16,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:16,382 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:16,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-04 14:31:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:16,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 14:31:16,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:16,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:16,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945007170] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:16,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:16,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 14:31:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746068356] [2023-05-04 14:31:16,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:16,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 14:31:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 14:31:16,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 14:31:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:16,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:16,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.111111111111111) internal successors, (128), 18 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) [2023-05-04 14:31:16,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:16,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:17,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 14:31:17,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash -534021195, now seen corresponding path program 2 times [2023-05-04 14:31:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:17,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158889112] [2023-05-04 14:31:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158889112] [2023-05-04 14:31:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158889112] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445604838] [2023-05-04 14:31:17,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:31:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:17,381 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:17,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-04 14:31:17,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:31:17,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:31:17,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 14:31:17,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:17,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 14:31:17,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445604838] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:17,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 14:31:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872874779] [2023-05-04 14:31:17,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:17,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 14:31:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 14:31:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 14:31:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:17,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.217391304347826) internal successors, (143), 23 states have internal predecessors, (143), 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) [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:17,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:18,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-05-04 14:31:18,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 14:31:18,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -265089299, now seen corresponding path program 3 times [2023-05-04 14:31:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:18,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384244470] [2023-05-04 14:31:18,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:31:18,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384244470] [2023-05-04 14:31:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384244470] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493702051] [2023-05-04 14:31:18,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 14:31:18,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:18,689 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:18,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-05-04 14:31:18,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 14:31:18,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:31:18,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 26 conjunts are in the unsatisfiable core [2023-05-04 14:31:18,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:18,829 INFO L390 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 7 treesize of output 6 [2023-05-04 14:31:19,202 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:31:19,202 INFO L390 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 [2023-05-04 14:31:19,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:31:19,237 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:19,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:31:19,341 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:19,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:31:19,570 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:19,587 INFO L390 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 14 treesize of output 10 [2023-05-04 14:31:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2023-05-04 14:31:19,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:23,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_813) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:31:25,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_813) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:31:26,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:31:26,130 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:31:26,131 INFO L390 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 13 treesize of output 12 [2023-05-04 14:31:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 16 not checked. [2023-05-04 14:31:26,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493702051] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:26,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:26,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 26 [2023-05-04 14:31:26,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544664190] [2023-05-04 14:31:26,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:26,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-04 14:31:26,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:26,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-04 14:31:26,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=8, NotChecked=90, Total=650 [2023-05-04 14:31:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:26,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:26,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 26 states have internal predecessors, (254), 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) [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:26,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:44,220 WARN L233 SmtUtils]: Spent 18.03s on a formula simplification. DAG size of input: 24 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 14:31:45,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-05-04 14:31:45,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:45,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1822886511, now seen corresponding path program 1 times [2023-05-04 14:31:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:45,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550715474] [2023-05-04 14:31:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:31:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:31:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550715474] [2023-05-04 14:31:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550715474] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:31:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383457113] [2023-05-04 14:31:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:46,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:31:46,025 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:31:46,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-05-04 14:31:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:31:46,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 14:31:46,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:31:46,163 INFO L390 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 7 treesize of output 6 [2023-05-04 14:31:46,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:31:46,425 INFO L390 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 [2023-05-04 14:31:46,458 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:46,554 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:46,559 INFO L390 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 [2023-05-04 14:31:46,801 INFO L390 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 13 treesize of output 15 [2023-05-04 14:31:46,824 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:31:46,825 INFO L390 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 19 treesize of output 11 [2023-05-04 14:31:46,906 INFO L390 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 14:31:46,953 INFO L390 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 17 treesize of output 13 [2023-05-04 14:31:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:31:46,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:31:47,215 INFO L390 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 18 treesize of output 12 [2023-05-04 14:31:47,231 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_902 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_901))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_902))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_902 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_901))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_902))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-05-04 14:31:47,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_902 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_901) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_902) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-05-04 14:31:47,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:31:47,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:31:47,968 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:31:47,968 INFO L390 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 13 treesize of output 12 [2023-05-04 14:31:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 16 not checked. [2023-05-04 14:31:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383457113] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:31:47,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:31:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 32 [2023-05-04 14:31:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018278786] [2023-05-04 14:31:47,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:31:47,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 14:31:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:31:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 14:31:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=757, Unknown=3, NotChecked=114, Total=992 [2023-05-04 14:31:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:47,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:31:47,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.21875) internal successors, (295), 32 states have internal predecessors, (295), 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) [2023-05-04 14:31:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:47,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:47,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:47,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:47,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:47,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 14:31:47,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:31:58,043 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 28 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:31:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 14:31:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-05-04 14:31:59,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-05-04 14:31:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:31:59,663 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:31:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:31:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1567984419, now seen corresponding path program 1 times [2023-05-04 14:31:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:31:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697434747] [2023-05-04 14:31:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:31:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:31:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:32:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:32:00,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:32:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697434747] [2023-05-04 14:32:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697434747] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:32:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099654037] [2023-05-04 14:32:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:32:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:32:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:32:00,362 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:32:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-05-04 14:32:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:32:00,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-04 14:32:00,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:32:00,509 INFO L390 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 7 treesize of output 6 [2023-05-04 14:32:00,746 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:32:00,746 INFO L390 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 [2023-05-04 14:32:00,779 INFO L390 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 13 treesize of output 15 [2023-05-04 14:32:00,883 INFO L390 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 13 treesize of output 15 [2023-05-04 14:32:01,035 INFO L390 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 13 treesize of output 15 [2023-05-04 14:32:01,138 INFO L390 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 0 case distinctions, treesize of input 24 treesize of output 17 [2023-05-04 14:32:01,244 INFO L390 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 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 14:32:01,308 INFO L390 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 20 treesize of output 16 [2023-05-04 14:32:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:32:01,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:32:05,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:07,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:09,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:11,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:13,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:19,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:19,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:32:19,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:32:19,896 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:32:19,896 INFO L390 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 13 treesize of output 12 [2023-05-04 14:32:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 16 not checked. [2023-05-04 14:32:19,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099654037] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:32:19,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:32:19,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 41 [2023-05-04 14:32:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568072967] [2023-05-04 14:32:19,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:32:19,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-04 14:32:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:32:19,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-04 14:32:19,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=997, Unknown=8, NotChecked=490, Total=1640 [2023-05-04 14:32:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:32:19,900 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:32:19,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 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) [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-05-04 14:32:19,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:32:29,999 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:32:50,136 WARN L233 SmtUtils]: Spent 20.03s on a formula simplification. DAG size of input: 26 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:33:28,500 WARN L233 SmtUtils]: Spent 38.10s on a formula simplification. DAG size of input: 24 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:34:07,608 WARN L233 SmtUtils]: Spent 38.07s on a formula simplification. DAG size of input: 25 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 14:34:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:34:08,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-05-04 14:34:08,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-05-04 14:34:08,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:34:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:34:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash -255934965, now seen corresponding path program 2 times [2023-05-04 14:34:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:34:08,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290387651] [2023-05-04 14:34:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:34:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:34:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:34:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:34:08,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:34:08,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290387651] [2023-05-04 14:34:08,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290387651] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:34:08,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429118057] [2023-05-04 14:34:08,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:34:08,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:34:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:34:08,945 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:34:08,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-05-04 14:34:09,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:34:09,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:34:09,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-04 14:34:09,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:34:09,084 INFO L390 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 7 treesize of output 6 [2023-05-04 14:34:09,377 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:34:09,378 INFO L390 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 [2023-05-04 14:34:09,400 INFO L390 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 13 treesize of output 15 [2023-05-04 14:34:09,477 INFO L390 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 13 treesize of output 15 [2023-05-04 14:34:09,496 INFO L390 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 [2023-05-04 14:34:09,745 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:34:09,745 INFO L390 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 19 treesize of output 11 [2023-05-04 14:34:09,825 INFO L390 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 14:34:09,876 INFO L390 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 17 treesize of output 13 [2023-05-04 14:34:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:34:09,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:34:10,179 INFO L390 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 18 treesize of output 12 [2023-05-04 14:34:12,187 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1097 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1097)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((v_ArrVal_1097 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1097)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2023-05-04 14:34:12,198 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1097 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1094 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1094))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1097))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_1097 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1094 (Array Int Int))) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1094))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1097))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-05-04 14:34:14,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1097 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1094 (Array Int Int))) (or (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1094) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1097) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-05-04 14:34:14,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:34:14,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:34:14,811 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:34:14,811 INFO L390 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 13 treesize of output 12 [2023-05-04 14:34:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 16 not checked. [2023-05-04 14:34:14,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429118057] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:34:14,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:34:14,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 35 [2023-05-04 14:34:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42730874] [2023-05-04 14:34:14,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:34:14,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-05-04 14:34:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:34:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-05-04 14:34:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=851, Unknown=3, NotChecked=186, Total=1190 [2023-05-04 14:34:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:34:14,815 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:34:14,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 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) [2023-05-04 14:34:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:14,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:34:14,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:14,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 14:34:14,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:34:14,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:34:32,979 WARN L233 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 34 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:34:41,051 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 31 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:34:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:34:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 14:34:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:34:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 14:34:42,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-05-04 14:34:42,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-05-04 14:34:42,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:34:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:34:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1097953839, now seen corresponding path program 2 times [2023-05-04 14:34:42,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:34:42,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219170957] [2023-05-04 14:34:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:34:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:34:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:34:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:34:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:34:43,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219170957] [2023-05-04 14:34:43,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219170957] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:34:43,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121123643] [2023-05-04 14:34:43,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 14:34:43,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:34:43,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:34:43,557 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:34:43,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-05-04 14:34:43,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 14:34:43,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:34:43,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-04 14:34:43,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:34:43,721 INFO L390 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 7 treesize of output 6 [2023-05-04 14:34:43,995 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:34:43,996 INFO L390 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 [2023-05-04 14:34:44,017 INFO L390 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 13 treesize of output 15 [2023-05-04 14:34:44,116 INFO L390 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 13 treesize of output 15 [2023-05-04 14:34:44,398 INFO L390 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 0 case distinctions, treesize of input 24 treesize of output 17 [2023-05-04 14:34:44,516 INFO L390 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 28 treesize of output 28 [2023-05-04 14:34:44,573 INFO L390 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 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 14:34:44,617 INFO L390 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 20 treesize of output 16 [2023-05-04 14:34:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:34:44,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:35:00,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem39#1|)))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~post37#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ |c_t_funThread2of2ForFork0_#t~mem36#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~mem36#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1202 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse2 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1199))) (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (let ((.cse1 (select .cse3 |t_funThread2of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store .cse2 |c_~#a~0.base| (store .cse3 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse1)))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:02,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1199))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1202) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-05-04 14:35:03,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 14:35:03,280 INFO L390 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 44 treesize of output 47 [2023-05-04 14:35:03,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 97 treesize of output 93 [2023-05-04 14:35:03,332 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 14:35:03,333 INFO L390 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 13 treesize of output 12 [2023-05-04 14:35:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 17 not checked. [2023-05-04 14:35:03,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121123643] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:35:03,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:35:03,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2023-05-04 14:35:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228429402] [2023-05-04 14:35:03,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:35:03,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 14:35:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:35:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 14:35:03,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=775, Unknown=14, NotChecked=650, Total=1560 [2023-05-04 14:35:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:35:03,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:35:03,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.0) internal successors, (320), 40 states have internal predecessors, (320), 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) [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 14:35:03,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:35:27,561 WARN L233 SmtUtils]: Spent 24.16s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:35:59,732 WARN L233 SmtUtils]: Spent 32.07s on a formula simplification. DAG size of input: 38 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:36:39,595 WARN L233 SmtUtils]: Spent 29.95s on a formula simplification. DAG size of input: 35 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:36:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:36:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:36:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:36:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:36:40,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:36:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:36:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:36:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 14:36:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:36:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-04 14:36:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 14:36:40,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-05-04 14:36:40,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:36:40,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 14:36:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 14:36:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1568310171, now seen corresponding path program 3 times [2023-05-04 14:36:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 14:36:40,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692427683] [2023-05-04 14:36:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 14:36:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 14:36:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 14:37:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 1 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 14:37:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 14:37:31,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692427683] [2023-05-04 14:37:31,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692427683] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 14:37:31,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003076916] [2023-05-04 14:37:31,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 14:37:31,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:37:31,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 14:37:31,464 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 14:37:31,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-05-04 14:37:31,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 14:37:31,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 14:37:31,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 39 conjunts are in the unsatisfiable core [2023-05-04 14:37:31,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 14:37:32,205 INFO L390 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 7 treesize of output 6 [2023-05-04 14:37:37,774 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:37:37,775 INFO L390 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 [2023-05-04 14:37:38,628 INFO L390 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 13 treesize of output 15 [2023-05-04 14:37:40,546 INFO L390 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 13 treesize of output 15 [2023-05-04 14:37:44,110 INFO L390 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 13 treesize of output 15 [2023-05-04 14:37:44,747 INFO L390 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 [2023-05-04 14:37:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:37:46,137 INFO L390 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 16 treesize of output 18 [2023-05-04 14:37:46,476 INFO L390 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 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 14:37:47,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 14:37:47,276 INFO L390 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 16 treesize of output 18 [2023-05-04 14:37:47,967 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 14:37:47,967 INFO L390 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 19 treesize of output 11 [2023-05-04 14:37:49,084 INFO L390 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 17 treesize of output 13 [2023-05-04 14:37:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2023-05-04 14:37:50,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 14:37:53,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 14:37:53,443 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-05-04 14:37:53,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 14:37:53,556 INFO L390 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 39 treesize of output 38 [2023-05-04 14:37:53,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 18 [2023-05-04 14:37:55,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or .cse1 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or .cse1 (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))))) is different from false [2023-05-04 14:37:55,905 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))))) is different from false [2023-05-04 14:37:56,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))))) is different from false [2023-05-04 14:38:12,152 WARN L233 SmtUtils]: Spent 14.63s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:38:19,942 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:38:22,296 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-05-04 14:38:23,186 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1290 (Array Int Int)) (v_ArrVal_1295 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1290) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1295) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-05-04 14:38:31,523 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:38:42,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:38:42,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-05-04 14:38:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 14:38:46,476 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-04 14:38:46,477 INFO L390 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 25 treesize of output 38 [2023-05-04 14:38:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 17 not checked. [2023-05-04 14:38:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003076916] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 14:38:46,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 14:38:46,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 19, 20] total 72 [2023-05-04 14:38:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072242593] [2023-05-04 14:38:46,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 14:38:46,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-05-04 14:38:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 14:38:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-05-04 14:38:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=3933, Unknown=28, NotChecked=670, Total=5112 [2023-05-04 14:38:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:38:46,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 14:38:46,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 5.125) internal successors, (369), 72 states have internal predecessors, (369), 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) [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 14:38:46,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 14:38:46,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-04 14:38:46,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-04 14:38:46,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 14:38:46,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 14:39:58,784 WARN L233 SmtUtils]: Spent 36.86s on a formula simplification. DAG size of input: 43 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:40:37,993 WARN L233 SmtUtils]: Spent 38.92s on a formula simplification. DAG size of input: 39 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:41:11,170 WARN L233 SmtUtils]: Spent 32.44s on a formula simplification. DAG size of input: 37 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:42:02,492 WARN L233 SmtUtils]: Spent 51.10s on a formula simplification. DAG size of input: 53 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:43:06,576 WARN L233 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 53 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 14:43:43,394 WARN L233 SmtUtils]: Spent 36.62s on a formula simplification. DAG size of input: 43 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 14:44:07,311 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:44:07,311 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:44:07,311 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:44:07,350 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:44:07,350 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 14:44:08,035 WARN L249 SmtUtils]: Removed 12 from assertion stack [2023-05-04 14:44:08,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-05-04 14:44:08,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 14:44:08,236 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 18488ms.. [2023-05-04 14:44:08,236 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 14:44:08,237 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1] [2023-05-04 14:44:08,238 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was TIMEOUT (1/3) [2023-05-04 14:44:08,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-05-04 14:44:08,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 14:44:08,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 02:44:08 BasicIcfg [2023-05-04 14:44:08,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 14:44:08,246 INFO L158 Benchmark]: Toolchain (without parser) took 864674.86ms. Allocated memory was 189.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 131.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 478.6MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,246 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 189.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 14:44:08,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.15ms. Allocated memory is still 189.8MB. Free memory was 130.8MB in the beginning and 143.5MB in the end (delta: -12.7MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.32ms. Allocated memory is still 189.8MB. Free memory was 143.5MB in the beginning and 140.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,247 INFO L158 Benchmark]: Boogie Preprocessor took 33.10ms. Allocated memory is still 189.8MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,247 INFO L158 Benchmark]: RCFGBuilder took 387.40ms. Allocated memory is still 189.8MB. Free memory was 138.5MB in the beginning and 120.4MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,247 INFO L158 Benchmark]: TraceAbstraction took 863731.89ms. Allocated memory was 189.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 466.9MB. Max. memory is 8.0GB. [2023-05-04 14:44:08,248 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.08ms. Allocated memory is still 189.8MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.15ms. Allocated memory is still 189.8MB. Free memory was 130.8MB in the beginning and 143.5MB in the end (delta: -12.7MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.32ms. Allocated memory is still 189.8MB. Free memory was 143.5MB in the beginning and 140.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.10ms. Allocated memory is still 189.8MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 387.40ms. Allocated memory is still 189.8MB. Free memory was 138.5MB in the beginning and 120.4MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 863731.89ms. Allocated memory was 189.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 119.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 466.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12698, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 627, dependent conditional: 566, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12142, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12142, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 19, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 12, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 12, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7041, independent: 6970, independent conditional: 3, independent unconditional: 6967, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7041, independent: 6940, independent conditional: 0, independent unconditional: 6940, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 30, independent conditional: 3, independent unconditional: 27, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 30, independent conditional: 3, independent unconditional: 27, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 151, dependent conditional: 15, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12164, independent: 5101, independent conditional: 0, independent unconditional: 5101, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 7041, unknown conditional: 13, unknown unconditional: 7028] , Statistics on independence cache: Total cache size (in pairs): 7041, Positive cache size: 6970, Positive conditional cache size: 3, Positive unconditional cache size: 6967, Negative cache size: 71, Negative conditional cache size: 10, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 3, Independence queries for same thread: 556 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 708, Number of trivial persistent sets: 643, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10778, independent: 10717, independent conditional: 0, independent unconditional: 10717, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12698, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 627, dependent conditional: 566, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12142, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12142, independent: 12071, independent conditional: 1354, independent unconditional: 10717, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 19, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 12, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12164, independent: 12071, independent conditional: 3, independent unconditional: 12068, dependent: 93, dependent conditional: 12, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7041, independent: 6970, independent conditional: 3, independent unconditional: 6967, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7041, independent: 6940, independent conditional: 0, independent unconditional: 6940, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 101, independent: 30, independent conditional: 3, independent unconditional: 27, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 30, independent conditional: 3, independent unconditional: 27, dependent: 71, dependent conditional: 10, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 86, independent conditional: 7, independent unconditional: 79, dependent: 151, dependent conditional: 15, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12164, independent: 5101, independent conditional: 0, independent unconditional: 5101, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 7041, unknown conditional: 13, unknown unconditional: 7028] , Statistics on independence cache: Total cache size (in pairs): 7041, Positive cache size: 6970, Positive conditional cache size: 3, Positive unconditional cache size: 6967, Negative cache size: 71, Negative conditional cache size: 10, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 3, Independence queries for same thread: 556 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7053, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 243, dependent conditional: 225, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5262, independent: 5244, independent conditional: 0, independent unconditional: 5244, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5262, independent: 5236, independent conditional: 0, independent unconditional: 5236, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6829, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 5262, unknown conditional: 0, unknown unconditional: 5262] , Statistics on independence cache: Total cache size (in pairs): 5262, Positive cache size: 5244, Positive conditional cache size: 0, Positive unconditional cache size: 5244, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 224 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 151, Number of trivial persistent sets: 129, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6606, independent: 6588, independent conditional: 0, independent unconditional: 6588, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7053, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 243, dependent conditional: 225, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 222, independent unconditional: 6588, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6829, independent: 6810, independent conditional: 0, independent unconditional: 6810, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5262, independent: 5244, independent conditional: 0, independent unconditional: 5244, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5262, independent: 5236, independent conditional: 0, independent unconditional: 5236, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6829, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 5262, unknown conditional: 0, unknown unconditional: 5262] , Statistics on independence cache: Total cache size (in pairs): 5262, Positive cache size: 5244, Positive conditional cache size: 0, Positive unconditional cache size: 5244, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 224 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 303299, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 17338, dependent conditional: 17135, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289205, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 3244, dependent conditional: 3041, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289205, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 3244, dependent conditional: 3041, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 12116, dependent unconditional: 3958, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 3912, dependent unconditional: 12162, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 3912, dependent unconditional: 12162, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25803, independent: 25458, independent conditional: 70, independent unconditional: 25388, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25803, independent: 25282, independent conditional: 0, independent unconditional: 25282, dependent: 521, dependent conditional: 0, dependent unconditional: 521, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 521, independent: 176, independent conditional: 70, independent unconditional: 106, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 521, independent: 176, independent conditional: 70, independent unconditional: 106, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1438, independent: 230, independent conditional: 108, independent unconditional: 122, dependent: 469, dependent conditional: 209, dependent unconditional: 261, unknown: 739, unknown conditional: 739, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302045, independent: 260476, independent conditional: 617, independent unconditional: 259859, dependent: 15730, dependent conditional: 3771, dependent unconditional: 11959, unknown: 25839, unknown conditional: 248, unknown unconditional: 25591] , Statistics on independence cache: Total cache size (in pairs): 25802, Positive cache size: 25458, Positive conditional cache size: 70, Positive unconditional cache size: 25388, Negative cache size: 344, Negative conditional cache size: 141, Negative unconditional cache size: 203, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 8204, Maximal queried relation: 7, Independence queries for same thread: 14094 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.9s, Number of persistent set computation: 15219, Number of trivial persistent sets: 13881, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45456, independent: 45253, independent conditional: 0, independent unconditional: 45253, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 303299, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 17338, dependent conditional: 17135, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 289205, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 3244, dependent conditional: 3041, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 289205, independent: 285934, independent conditional: 240681, independent unconditional: 45253, dependent: 3244, dependent conditional: 3041, dependent unconditional: 203, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 12116, dependent unconditional: 3958, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 3912, dependent unconditional: 12162, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 302045, independent: 285934, independent conditional: 687, independent unconditional: 285247, dependent: 16074, dependent conditional: 3912, dependent unconditional: 12162, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25803, independent: 25458, independent conditional: 70, independent unconditional: 25388, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25803, independent: 25282, independent conditional: 0, independent unconditional: 25282, dependent: 521, dependent conditional: 0, dependent unconditional: 521, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 521, independent: 176, independent conditional: 70, independent unconditional: 106, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 521, independent: 176, independent conditional: 70, independent unconditional: 106, dependent: 344, dependent conditional: 141, dependent unconditional: 203, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1438, independent: 230, independent conditional: 108, independent unconditional: 122, dependent: 469, dependent conditional: 209, dependent unconditional: 261, unknown: 739, unknown conditional: 739, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 302045, independent: 260476, independent conditional: 617, independent unconditional: 259859, dependent: 15730, dependent conditional: 3771, dependent unconditional: 11959, unknown: 25839, unknown conditional: 248, unknown unconditional: 25591] , Statistics on independence cache: Total cache size (in pairs): 25802, Positive cache size: 25458, Positive conditional cache size: 70, Positive unconditional cache size: 25388, Negative cache size: 344, Negative conditional cache size: 141, Negative unconditional cache size: 203, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 8204, Maximal queried relation: 7, Independence queries for same thread: 14094 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 67 for 18488ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 231 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 86.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 75.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1459 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2013 ConstructedInterpolants, 220 QuantifiedInterpolants, 12575 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1362 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 1498/1893 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 errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 231 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 1216 SizeOfPredicates, 22 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 43/419 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 errors in thread instance: t_funThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 292 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 774.4s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 587.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 183.0s InterpolantComputationTime, 3278 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4732 ConstructedInterpolants, 932 QuantifiedInterpolants, 61043 SizeOfPredicates, 123 NumberOfNonLiveVariables, 3252 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 4344/5202 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown