./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 17:57:52,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 17:57:52,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-21 17:57:52,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 17:57:52,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 17:57:52,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 17:57:52,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 17:57:52,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 17:57:52,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 17:57:52,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 17:57:52,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 17:57:52,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 17:57:52,123 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 17:57:52,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 17:57:52,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 17:57:52,125 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 17:57:52,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 17:57:52,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 17:57:52,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 17:57:52,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 17:57:52,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 17:57:52,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 17:57:52,127 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 17:57:52,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 17:57:52,128 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 17:57:52,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 17:57:52,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 17:57:52,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 17:57:52,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 17:57:52,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 17:57:52,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 17:57:52,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 17:57:52,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 17:57:52,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 17:57:52,131 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-21 17:57:52,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 17:57:52,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 17:57:52,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 17:57:52,132 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 17:57:52,132 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 17:57:52,132 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 17:57:52,133 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 17:57:52,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 17:57:52,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 17:57:52,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 17:57:52,477 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 17:57:52,478 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 17:57:52,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-11-21 17:57:53,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 17:57:53,922 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 17:57:53,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2023-11-21 17:57:53,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d63674f12/6ca534d5a0224772ab55ae24cb3bc915/FLAG2166452f3 [2023-11-21 17:57:53,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d63674f12/6ca534d5a0224772ab55ae24cb3bc915 [2023-11-21 17:57:53,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 17:57:53,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 17:57:53,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 17:57:53,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 17:57:53,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 17:57:53,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:57:53" (1/1) ... [2023-11-21 17:57:53,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4587db7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:53, skipping insertion in model container [2023-11-21 17:57:53,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:57:53" (1/1) ... [2023-11-21 17:57:54,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 17:57:54,436 WARN L240 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_72-funloop_hard_racing.i[41323,41336] [2023-11-21 17:57:54,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 17:57:54,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 17:57:54,509 WARN L240 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_72-funloop_hard_racing.i[41323,41336] [2023-11-21 17:57:54,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 17:57:54,585 INFO L206 MainTranslator]: Completed translation [2023-11-21 17:57:54,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54 WrapperNode [2023-11-21 17:57:54,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 17:57:54,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 17:57:54,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 17:57:54,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 17:57:54,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,641 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 288 [2023-11-21 17:57:54,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 17:57:54,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 17:57:54,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 17:57:54,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 17:57:54,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,658 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,688 INFO L193 HeapSplitter]: Split 24 memory accesses to 4 slices as follows [2, 15, 5, 2] [2023-11-21 17:57:54,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 17:57:54,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 17:57:54,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 17:57:54,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 17:57:54,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (1/1) ... [2023-11-21 17:57:54,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 17:57:54,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:57:54,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 17:57:54,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 17:57:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 17:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 17:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 17:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 17:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 17:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 17:57:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 17:57:54,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 17:57:54,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 17:57:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 17:57:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 17:57:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 17:57:54,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 17:57:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-21 17:57:54,835 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-21 17:57:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 17:57:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 17:57:54,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 17:57:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 17:57:54,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 17:57:54,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 17:57:54,839 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 17:57:55,046 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 17:57:55,048 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 17:57:55,466 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 17:57:55,642 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 17:57:55,642 INFO L308 CfgBuilder]: Removed 35 assume(true) statements. [2023-11-21 17:57:55,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:57:55 BoogieIcfgContainer [2023-11-21 17:57:55,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 17:57:55,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 17:57:55,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 17:57:55,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 17:57:55,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:57:53" (1/3) ... [2023-11-21 17:57:55,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa5fef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:57:55, skipping insertion in model container [2023-11-21 17:57:55,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:57:54" (2/3) ... [2023-11-21 17:57:55,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa5fef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:57:55, skipping insertion in model container [2023-11-21 17:57:55,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:57:55" (3/3) ... [2023-11-21 17:57:55,655 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2023-11-21 17:57:55,662 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 17:57:55,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 17:57:55,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-21 17:57:55,671 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 17:57:55,710 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 17:57:55,746 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 17:57:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 17:57:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:57:55,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 17:57:55,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 17:57:55,790 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 17:57:55,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-11-21 17:57:55,805 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=LoopHeads, 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;@1ae0f8d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 17:57:55,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 17:57:55,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:57:55,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:57:55,952 INFO L85 PathProgramCache]: Analyzing trace with hash 592397242, now seen corresponding path program 1 times [2023-11-21 17:57:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:57:55,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033280056] [2023-11-21 17:57:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:57:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:57:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:57:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:57:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033280056] [2023-11-21 17:57:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033280056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 17:57:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 17:57:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 17:57:56,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288150693] [2023-11-21 17:57:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 17:57:56,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 17:57:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 17:57:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 17:57:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 17:57:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:56,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 17:57:56,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-11-21 17:57:56,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:56,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:57:56,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 17:57:56,440 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:57:56,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:57:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash 830315706, now seen corresponding path program 1 times [2023-11-21 17:57:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:57:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204159761] [2023-11-21 17:57:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:57:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:57:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:57:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:57:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204159761] [2023-11-21 17:57:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204159761] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 17:57:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854233762] [2023-11-21 17:57:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:57:56,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:57:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:57:56,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 17:57:56,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 17:57:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:57:56,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 17:57:56,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 17:57:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:56,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 17:57:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854233762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 17:57:56,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 17:57:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-21 17:57:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663203526] [2023-11-21 17:57:56,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 17:57:56,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 17:57:56,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 17:57:56,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 17:57:56,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 17:57:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:56,714 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 17:57:56,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-11-21 17:57:56,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:57:56,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:57:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:57:56,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 17:57:57,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-21 17:57:57,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:57:57,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:57:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1755153338, now seen corresponding path program 2 times [2023-11-21 17:57:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:57:57,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238616263] [2023-11-21 17:57:57,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:57:57,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:57:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:57:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:57:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238616263] [2023-11-21 17:57:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238616263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 17:57:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024225692] [2023-11-21 17:57:57,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 17:57:57,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:57:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:57:57,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 17:57:57,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 17:57:57,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 17:57:57,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 17:57:57,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 17:57:57,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 17:57:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:57,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 17:57:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 17:57:57,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024225692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 17:57:57,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 17:57:57,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-21 17:57:57,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457885024] [2023-11-21 17:57:57,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 17:57:57,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-21 17:57:57,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 17:57:57,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 17:57:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 17:57:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:57,403 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 17:57:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 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-11-21 17:57:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:57:57,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:57:57,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:57:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:57:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:57:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 17:57:57,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 17:57:57,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:57:57,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:57:57,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:57:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 896983994, now seen corresponding path program 3 times [2023-11-21 17:57:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:57:57,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78358126] [2023-11-21 17:57:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:57:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:57:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:57:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:57:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:57:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78358126] [2023-11-21 17:57:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78358126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 17:57:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285442209] [2023-11-21 17:57:58,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 17:57:58,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:57:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:57:58,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 17:57:58,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 17:57:58,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 17:57:58,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 17:57:58,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-21 17:57:58,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 17:57:58,143 INFO L378 Elim1Store]: Elim1 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-11-21 17:57:58,271 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 25 [2023-11-21 17:57:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:57:58,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 17:58:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:58:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285442209] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 17:58:00,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 17:58:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-21 17:58:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666839100] [2023-11-21 17:58:00,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 17:58:00,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 17:58:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 17:58:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 17:58:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2023-11-21 17:58:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:58:00,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 17:58:00,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-11-21 17:58:00,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:58:00,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:58:00,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 17:58:00,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:58:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:58:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:58:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 17:58:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 17:58:00,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 17:58:00,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:58:00,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:58:00,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:58:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1018715178, now seen corresponding path program 1 times [2023-11-21 17:58:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:58:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934904878] [2023-11-21 17:58:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:58:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:58:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:58:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:58:01,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:58:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934904878] [2023-11-21 17:58:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934904878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 17:58:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883826535] [2023-11-21 17:58:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:58:01,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:58:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:58:01,245 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 17:58:01,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 17:58:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:58:01,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 17:58:01,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 17:58:01,394 INFO L378 Elim1Store]: Elim1 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-11-21 17:58:01,550 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 17 [2023-11-21 17:58:01,612 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 22 [2023-11-21 17:58:03,493 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 30 [2023-11-21 17:58:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:58:03,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 17:58:14,578 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int#1| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24|) 0))) is different from false [2023-11-21 17:58:16,394 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24|) 0))) is different from false [2023-11-21 17:58:18,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_235 (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_24|) 0))) is different from false [2023-11-21 17:58:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-11-21 17:58:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883826535] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 17:58:32,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 17:58:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-21 17:58:32,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821735699] [2023-11-21 17:58:32,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 17:58:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-21 17:58:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 17:58:32,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-21 17:58:32,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=226, Unknown=14, NotChecked=102, Total=420 [2023-11-21 17:58:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:58:32,688 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 17:58:32,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.0476190476190474) internal successors, (106), 20 states have internal predecessors, (106), 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-11-21 17:58:32,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:58:32,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:58:32,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 17:58:32,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 17:58:32,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 17:58:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 17:58:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 17:58:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 17:58:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 17:58:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 17:58:34,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 17:58:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:58:34,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 17:58:34,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 17:58:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1643331058, now seen corresponding path program 2 times [2023-11-21 17:58:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 17:58:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486207918] [2023-11-21 17:58:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 17:58:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 17:58:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 17:58:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:58:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 17:58:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486207918] [2023-11-21 17:58:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486207918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 17:58:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155594602] [2023-11-21 17:58:36,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 17:58:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 17:58:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 17:58:36,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 17:58:36,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 17:58:36,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 17:58:36,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 17:58:36,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 17:58:36,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 17:58:36,341 INFO L378 Elim1Store]: Elim1 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-11-21 17:58:36,516 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 17 [2023-11-21 17:58:36,598 INFO L378 Elim1Store]: Elim1 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 31 treesize of output 22 [2023-11-21 17:58:39,473 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 22 [2023-11-21 17:58:42,562 INFO L378 Elim1Store]: Elim1 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 72 treesize of output 57 [2023-11-21 17:58:58,790 INFO L378 Elim1Store]: Elim1 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 76 treesize of output 62 [2023-11-21 17:58:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-21 17:58:58,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 17:59:20,972 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (or (= (select (select |c_#memory_int#1| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-21 17:59:23,037 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (or (= (select (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-21 17:59:25,091 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (or (= (select (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_368 (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-11-21 17:59:27,151 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) (= (select (store (select |c_#memory_int#1| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ v_ArrVal_368 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-21 17:59:57,418 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of1ForFork0_~i~0#1_26| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_26| 28))) (or (= (select (store (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ v_ArrVal_368 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) (< |v_t_funThread1of1ForFork0_~i~0#1_26| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ .cse1 28 |c_~#cache~0.offset|))))) is different from false [2023-11-21 17:59:59,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (v_ArrVal_364 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int) (|v_t_funThread1of1ForFork0_~i~0#1_26| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_26| 28))) (or (= (select (store (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_364 (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ v_ArrVal_368 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) (< |v_t_funThread1of1ForFork0_~i~0#1_26| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-11-21 18:00:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 31 not checked. [2023-11-21 18:00:25,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155594602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 18:00:25,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 18:00:25,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2023-11-21 18:00:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115260071] [2023-11-21 18:00:25,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 18:00:25,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-21 18:00:25,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 18:00:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-21 18:00:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=506, Unknown=49, NotChecked=330, Total=1056 [2023-11-21 18:00:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 18:00:25,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 18:00:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.03030303030303) internal successors, (166), 32 states have internal predecessors, (166), 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-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-21 18:00:25,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 18:00:27,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:28,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:30,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:31,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:33,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:34,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:46,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 18:00:48,918 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_26| Int)) (or (forall ((v_ArrVal_368 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_26| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33|) (= (select (store (select |c_#memory_int#1| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_33| (+ v_ArrVal_368 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_26| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| Int)) (or (= (select (select (store |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int#1| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_31| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))))) is different from false [2023-11-21 18:00:50,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:00:52,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:17,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:19,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:21,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:23,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:25,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:27,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:29,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:31,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:33,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:35,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:37,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:39,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:41,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 18:01:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 18:01:41,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 18:01:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 18:01:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 18:01:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 18:01:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 18:01:41,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-21 18:01:41,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 18:01:41,480 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 18:01:41,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 18:01:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1882007622, now seen corresponding path program 3 times [2023-11-21 18:01:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 18:01:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677571044] [2023-11-21 18:01:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 18:01:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 18:01:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15