./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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_79-equ_racefree.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 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-19 08:46:31,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 08:46:31,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 08:46:31,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 08:46:31,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 08:46:31,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 08:46:31,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 08:46:31,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 08:46:31,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 08:46:31,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 08:46:31,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 08:46:31,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 08:46:31,673 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 08:46:31,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 08:46:31,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 08:46:31,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 08:46:31,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 08:46:31,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 08:46:31,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 08:46:31,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 08:46:31,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 08:46:31,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 08:46:31,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 08:46:31,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 08:46:31,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 08:46:31,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 08:46:31,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 08:46:31,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 08:46:31,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 08:46:31,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 08:46:31,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:46:31,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 08:46:31,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 08:46:31,682 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 08:46:31,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 08:46:31,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 08:46:31,683 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 08:46:31,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 08:46:31,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 08:46:31,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 08:46:31,685 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 08:46:31,685 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 -> 5ac72ff2379990464c5f55660be1e08b12557a61aceeef8401296ef66be035fc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 08:46:31,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 08:46:31,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 08:46:31,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 08:46:31,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 08:46:31,984 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 08:46:31,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2024-10-19 08:46:33,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 08:46:33,679 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 08:46:33,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2024-10-19 08:46:33,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2fe5245d1/2613c70de89b47f8a100c54b11183656/FLAG0488c52a4 [2024-10-19 08:46:33,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2fe5245d1/2613c70de89b47f8a100c54b11183656 [2024-10-19 08:46:33,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 08:46:33,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 08:46:33,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 08:46:33,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 08:46:33,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 08:46:33,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:46:33" (1/1) ... [2024-10-19 08:46:33,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e76edde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:33, skipping insertion in model container [2024-10-19 08:46:33,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 08:46:33" (1/1) ... [2024-10-19 08:46:33,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 08:46:34,246 WARN L247 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_79-equ_racefree.i[47038,47051] [2024-10-19 08:46:34,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:46:34,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 08:46:34,344 WARN L247 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_79-equ_racefree.i[47038,47051] [2024-10-19 08:46:34,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 08:46:34,427 INFO L204 MainTranslator]: Completed translation [2024-10-19 08:46:34,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34 WrapperNode [2024-10-19 08:46:34,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 08:46:34,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 08:46:34,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 08:46:34,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 08:46:34,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,500 INFO L138 Inliner]: procedures = 272, calls = 64, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 226 [2024-10-19 08:46:34,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 08:46:34,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 08:46:34,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 08:46:34,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 08:46:34,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 08:46:34,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 08:46:34,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 08:46:34,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 08:46:34,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (1/1) ... [2024-10-19 08:46:34,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 08:46:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:46:34,573 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) [2024-10-19 08:46:34,575 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 [2024-10-19 08:46:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 08:46:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 08:46:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 08:46:34,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 08:46:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 08:46:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 08:46:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 08:46:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-19 08:46:34,621 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-19 08:46:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 08:46:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 08:46:34,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 08:46:34,623 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 08:46:34,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 08:46:34,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 08:46:35,053 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 08:46:35,053 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 08:46:35,275 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 08:46:35,275 INFO L314 CfgBuilder]: Removed 22 assume(true) statements. [2024-10-19 08:46:35,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:46:35 BoogieIcfgContainer [2024-10-19 08:46:35,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 08:46:35,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 08:46:35,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 08:46:35,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 08:46:35,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 08:46:33" (1/3) ... [2024-10-19 08:46:35,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a685a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:46:35, skipping insertion in model container [2024-10-19 08:46:35,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 08:46:34" (2/3) ... [2024-10-19 08:46:35,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a685a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 08:46:35, skipping insertion in model container [2024-10-19 08:46:35,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 08:46:35" (3/3) ... [2024-10-19 08:46:35,286 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2024-10-19 08:46:35,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 08:46:35,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 08:46:35,302 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 08:46:35,345 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 08:46:35,396 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:46:35,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:46:35,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:46:35,399 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) [2024-10-19 08:46:35,400 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 [2024-10-19 08:46:35,483 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:46:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:35,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-19 08:46:35,519 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:46:35,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:46:36,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:46:36,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1633563581, now seen corresponding path program 1 times [2024-10-19 08:46:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:46:36,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065346505] [2024-10-19 08:46:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:46:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:46:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065346505] [2024-10-19 08:46:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065346505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:46:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:46:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:46:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776469299] [2024-10-19 08:46:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:46:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:46:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:46:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:46:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:46:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:36,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:46:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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) [2024-10-19 08:46:36,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:37,731 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:46:37,732 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:46:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2093968517, now seen corresponding path program 1 times [2024-10-19 08:46:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:37,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:38,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:46:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:46:38,297 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:38,298 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:46:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 983998769, now seen corresponding path program 1 times [2024-10-19 08:46:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:38,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:38,666 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:38,667 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:46:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1932313437, now seen corresponding path program 1 times [2024-10-19 08:46:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:40,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:41,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-10-19 08:46:41,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:46:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash -57152170, now seen corresponding path program 1 times [2024-10-19 08:46:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:46:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123559352] [2024-10-19 08:46:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:46:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:46:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123559352] [2024-10-19 08:46:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123559352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:46:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633404197] [2024-10-19 08:46:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:46:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:46:41,258 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) [2024-10-19 08:46:41,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-19 08:46:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:41,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 08:46:41,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:46:41,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:46:41,395 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:46:41,426 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:46:41,487 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:46:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:46:41,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:46:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:46:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633404197] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:46:41,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:46:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 08:46:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74923999] [2024-10-19 08:46:41,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:46:41,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 08:46:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:46:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 08:46:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=76, Unknown=4, NotChecked=0, Total=110 [2024-10-19 08:46:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:41,640 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:46:41,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:46:41,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:41,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:41,911 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:41,912 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:46:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1932313418, now seen corresponding path program 1 times [2024-10-19 08:46:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:42,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-19 08:46:42,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:46:42,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-19 08:46:42,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-19 08:46:42,858 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-19 08:46:42,860 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-19 08:46:42,864 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:46:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:46:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:46:42,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:46:42,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-19 08:46:42,909 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:46:42,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:42,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 08:46:42,918 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:46:42,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 08:46:43,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:46:43,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash 983040905, now seen corresponding path program 1 times [2024-10-19 08:46:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:46:43,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640221194] [2024-10-19 08:46:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:46:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640221194] [2024-10-19 08:46:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640221194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:46:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:46:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:46:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514996010] [2024-10-19 08:46:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:46:43,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:46:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:46:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:46:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:46:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:43,154 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:46:43,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2024-10-19 08:46:43,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:46:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-19 08:46:43,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:46:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 863023594, now seen corresponding path program 1 times [2024-10-19 08:46:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:46:43,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127739330] [2024-10-19 08:46:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:43,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:43,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 08:46:43,269 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 08:46:43,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 08:46:43,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 08:46:43,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-19 08:46:43,272 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-19 08:46:43,273 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-19 08:46:43,273 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 08:46:43,273 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-19 08:46:43,297 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 08:46:43,300 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:46:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:46:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:46:43,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:46:43,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-19 08:46:43,346 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:46:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:46:43,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-19 08:46:43,351 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:46:43,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:46:44,909 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:44,909 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:46:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -692852619, now seen corresponding path program 1 times [2024-10-19 08:46:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:45,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:46:45,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:46:49,430 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:46:49,431 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:46:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 343274050, now seen corresponding path program 1 times [2024-10-19 08:46:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:49,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:49,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:46:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:46:51,622 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:46:51,623 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:46:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -797786017, now seen corresponding path program 1 times [2024-10-19 08:46:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:46:51,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-19 08:46:52,386 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:46:52,386 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:46:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash 335937907, now seen corresponding path program 1 times [2024-10-19 08:46:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:52,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 08:46:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-19 08:46:52,902 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:52,902 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:46:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -52602352, now seen corresponding path program 1 times [2024-10-19 08:46:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:55,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:55,193 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:55,193 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:46:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1395176114, now seen corresponding path program 1 times [2024-10-19 08:46:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:46:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:46:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 08:46:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-19 08:46:57,832 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:46:57,832 INFO L378 Elim1Store]: Elim1 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 1260 treesize of output 1120 [2024-10-19 08:46:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash -52602334, now seen corresponding path program 1 times [2024-10-19 08:46:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:46:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:46:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:46:59,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:46:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:00,128 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:00,129 INFO L378 Elim1Store]: Elim1 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 2466 treesize of output 2182 [2024-10-19 08:47:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash 599432825, now seen corresponding path program 1 times [2024-10-19 08:47:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:02,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:02,389 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:02,390 INFO L378 Elim1Store]: Elim1 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 2354 treesize of output 2070 [2024-10-19 08:47:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1292473929, now seen corresponding path program 1 times [2024-10-19 08:47:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:02,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:02,701 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:02,701 INFO L378 Elim1Store]: Elim1 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 2562 treesize of output 2278 [2024-10-19 08:47:04,825 INFO L85 PathProgramCache]: Analyzing trace with hash 537301975, now seen corresponding path program 1 times [2024-10-19 08:47:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:04,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:05,145 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 27 [2024-10-19 08:47:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash -457332937, now seen corresponding path program 1 times [2024-10-19 08:47:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:07,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:07,513 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:07,514 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:47:07,627 INFO L85 PathProgramCache]: Analyzing trace with hash -423100062, now seen corresponding path program 1 times [2024-10-19 08:47:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:07,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:07,774 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:07,775 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:47:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1270802328, now seen corresponding path program 1 times [2024-10-19 08:47:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:09,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:10,127 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 27 [2024-10-19 08:47:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 124900724, now seen corresponding path program 1 times [2024-10-19 08:47:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:12,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:12,353 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:12,354 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:47:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1805752799, now seen corresponding path program 1 times [2024-10-19 08:47:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:14,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:14,593 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:14,593 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:47:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1053642100, now seen corresponding path program 1 times [2024-10-19 08:47:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:16,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:16,827 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:16,828 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:47:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1560198011, now seen corresponding path program 1 times [2024-10-19 08:47:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:16,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:16,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:17,062 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:17,063 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:47:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2041362910, now seen corresponding path program 1 times [2024-10-19 08:47:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:17,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:17,359 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:17,360 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:47:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash 747553607, now seen corresponding path program 1 times [2024-10-19 08:47:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:19,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:19,592 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:19,592 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:47:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1696949605, now seen corresponding path program 1 times [2024-10-19 08:47:21,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:21,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:21,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:21,897 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 27 [2024-10-19 08:47:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -668620223, now seen corresponding path program 1 times [2024-10-19 08:47:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:22,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:22,317 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 27 [2024-10-19 08:47:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash -915307580, now seen corresponding path program 1 times [2024-10-19 08:47:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:24,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:24,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:47:24,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 856876901, now seen corresponding path program 1 times [2024-10-19 08:47:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765915709] [2024-10-19 08:47:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:47:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765915709] [2024-10-19 08:47:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765915709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:47:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081573129] [2024-10-19 08:47:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:24,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:47:24,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:24,848 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) [2024-10-19 08:47:24,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-19 08:47:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:24,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 08:47:24,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:47:25,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:47:25,003 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:47:25,024 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:25,071 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:47:25,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:47:25,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_990) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-19 08:47:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081573129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:47:25,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:47:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 08:47:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987021934] [2024-10-19 08:47:25,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:47:25,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 08:47:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 08:47:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2024-10-19 08:47:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:25,178 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2024-10-19 08:47:25,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:25,478 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:25,479 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:47:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 599432926, now seen corresponding path program 1 times [2024-10-19 08:47:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:25,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:25,663 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:25,663 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:47:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1292473832, now seen corresponding path program 1 times [2024-10-19 08:47:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:25,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:25,872 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:25,872 INFO L378 Elim1Store]: Elim1 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 1260 treesize of output 1120 [2024-10-19 08:47:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash 537302066, now seen corresponding path program 1 times [2024-10-19 08:47:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:27,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:28,231 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 27 [2024-10-19 08:47:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash -457332850, now seen corresponding path program 1 times [2024-10-19 08:47:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:30,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:30,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:30,430 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:30,431 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:47:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash -423099981, now seen corresponding path program 1 times [2024-10-19 08:47:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:30,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:30,776 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 27 [2024-10-19 08:47:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 124900804, now seen corresponding path program 1 times [2024-10-19 08:47:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:32,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:47:34,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-19 08:47:34,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-10-19 08:47:34,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:47:34,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash -790374893, now seen corresponding path program 1 times [2024-10-19 08:47:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:34,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626389823] [2024-10-19 08:47:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626389823] [2024-10-19 08:47:34,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626389823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:47:34,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729219626] [2024-10-19 08:47:34,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:34,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:47:34,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:34,626 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) [2024-10-19 08:47:34,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-19 08:47:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:34,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-19 08:47:34,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:47:34,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:47:34,780 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:47:34,796 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:34,816 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:34,850 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:34,871 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 19 treesize of output 11 [2024-10-19 08:47:34,893 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 19 treesize of output 11 [2024-10-19 08:47:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:34,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:47:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:35,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729219626] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:47:35,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:47:35,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-19 08:47:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381837736] [2024-10-19 08:47:35,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:47:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-19 08:47:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-19 08:47:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=118, Unknown=3, NotChecked=0, Total=156 [2024-10-19 08:47:35,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:35,045 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:35,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 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) [2024-10-19 08:47:35,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:47:35,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:47:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-19 08:47:36,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-19 08:47:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:47:36,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:47:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash -17642157, now seen corresponding path program 2 times [2024-10-19 08:47:36,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:36,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892833703] [2024-10-19 08:47:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892833703] [2024-10-19 08:47:37,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892833703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:47:37,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898540502] [2024-10-19 08:47:37,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 08:47:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:47:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:37,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:47:37,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-19 08:47:37,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 08:47:37,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 08:47:37,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-19 08:47:37,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:47:37,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:47:37,206 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:47:37,230 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:37,258 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:37,303 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 19 treesize of output 11 [2024-10-19 08:47:37,348 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 19 treesize of output 11 [2024-10-19 08:47:37,357 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:37,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:47:37,465 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1308) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:37,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1308) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:37,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1308) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:37,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1303) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1308) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-19 08:47:37,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898540502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:47:37,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:47:37,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-10-19 08:47:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852349855] [2024-10-19 08:47:37,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:47:37,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-19 08:47:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-19 08:47:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=105, Unknown=4, NotChecked=92, Total=240 [2024-10-19 08:47:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:37,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:37,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 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) [2024-10-19 08:47:37,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:47:37,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-19 08:47:37,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:47:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 08:47:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 08:47:39,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:47:39,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-19 08:47:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-19 08:47:39,712 INFO L414 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:47:39,712 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-19 08:47:39,715 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:47:39,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:47:39,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:39,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:47:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-10-19 08:47:39,750 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:47:39,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:39,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 08:47:39,754 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:47:39,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 08:47:40,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -111308011, now seen corresponding path program 1 times [2024-10-19 08:47:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629407567] [2024-10-19 08:47:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 08:47:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:40,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629407567] [2024-10-19 08:47:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629407567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:47:40,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:47:40,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:47:40,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306041141] [2024-10-19 08:47:40,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:47:40,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:47:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:40,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:47:40,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:47:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,210 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:40,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2024-10-19 08:47:40,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-19 08:47:40,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:40,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash -992195672, now seen corresponding path program 1 times [2024-10-19 08:47:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:40,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067390551] [2024-10-19 08:47:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:40,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067390551] [2024-10-19 08:47:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067390551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:47:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:47:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-19 08:47:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425734372] [2024-10-19 08:47:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:47:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 08:47:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:47:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:47:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,617 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:40,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-10-19 08:47:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:40,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 08:47:40,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-19 08:47:40,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:40,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash -52605563, now seen corresponding path program 1 times [2024-10-19 08:47:40,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:40,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480764788] [2024-10-19 08:47:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:40,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:40,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 08:47:40,741 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 08:47:40,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 08:47:40,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 08:47:40,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-19 08:47:40,744 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-19 08:47:40,745 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-19 08:47:40,745 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 08:47:40,745 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-19 08:47:40,767 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-19 08:47:40,773 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:47:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:47:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:40,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:47:40,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-19 08:47:40,825 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:47:40,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:40,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 08:47:40,829 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:47:40,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 08:47:41,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1276955089, now seen corresponding path program 1 times [2024-10-19 08:47:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:41,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476514274] [2024-10-19 08:47:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-19 08:47:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476514274] [2024-10-19 08:47:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476514274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:47:41,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:47:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:47:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868110512] [2024-10-19 08:47:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:47:41,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:47:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:47:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:47:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:41,520 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:41,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 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) [2024-10-19 08:47:41,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:41,952 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:41,953 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:47:42,048 INFO L85 PathProgramCache]: Analyzing trace with hash -319114369, now seen corresponding path program 1 times [2024-10-19 08:47:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:42,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:47:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:47:42,377 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:42,378 INFO L378 Elim1Store]: Elim1 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 2354 treesize of output 2070 [2024-10-19 08:47:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 11747980, now seen corresponding path program 1 times [2024-10-19 08:47:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:44,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:45,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-10-19 08:47:45,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash -227451340, now seen corresponding path program 1 times [2024-10-19 08:47:45,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:45,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894825950] [2024-10-19 08:47:45,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:45,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-19 08:47:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:45,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894825950] [2024-10-19 08:47:45,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894825950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:47:45,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:47:45,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-19 08:47:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480574468] [2024-10-19 08:47:45,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:47:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-19 08:47:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:45,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-19 08:47:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:47:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:45,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-10-19 08:47:45,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:45,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:45,303 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:45,303 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:47:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 11748039, now seen corresponding path program 1 times [2024-10-19 08:47:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:45,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-19 08:47:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,SelfDestructingSolverStorable53 [2024-10-19 08:47:45,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:47:45,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1930485459, now seen corresponding path program 1 times [2024-10-19 08:47:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756431338] [2024-10-19 08:47:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:45,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:45,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 08:47:45,501 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 08:47:45,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 08:47:45,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 08:47:45,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-19 08:47:45,503 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-19 08:47:45,503 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-19 08:47:45,503 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 08:47:45,503 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-19 08:47:45,524 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 08:47:45,526 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:47:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:47:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:45,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:47:45,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-10-19 08:47:45,571 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:47:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:45,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-19 08:47:45,576 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:47:45,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:47:46,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:47:46,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1623362513, now seen corresponding path program 1 times [2024-10-19 08:47:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423899176] [2024-10-19 08:47:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-19 08:47:46,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423899176] [2024-10-19 08:47:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423899176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:47:46,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:47:46,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:47:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78824616] [2024-10-19 08:47:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:47:46,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:47:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:47:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:47:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:46,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:46,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:47:46,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:47,309 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:47,309 INFO L378 Elim1Store]: Elim1 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 613 treesize of output 545 [2024-10-19 08:47:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1449003264, now seen corresponding path program 1 times [2024-10-19 08:47:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:47,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:47,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:47:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:47:47,692 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:47,693 INFO L378 Elim1Store]: Elim1 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 2562 treesize of output 2278 [2024-10-19 08:47:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1851870547, now seen corresponding path program 1 times [2024-10-19 08:47:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:47,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:48,575 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:48,575 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:47:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -632840564, now seen corresponding path program 1 times [2024-10-19 08:47:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:48,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:47:48,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:47:48,944 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:48,945 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:47:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1851870461, now seen corresponding path program 1 times [2024-10-19 08:47:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:49,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:49,241 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:47:49,242 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:47:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash 840439001, now seen corresponding path program 1 times [2024-10-19 08:47:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:51,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:47:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:47:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:52,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2024-10-19 08:47:52,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:47:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:47:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1034508286, now seen corresponding path program 1 times [2024-10-19 08:47:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:47:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057835460] [2024-10-19 08:47:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:47:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:47:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057835460] [2024-10-19 08:47:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057835460] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:47:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361417456] [2024-10-19 08:47:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:53,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:47:53,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:47:53,546 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:47:53,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-19 08:47:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:53,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-19 08:47:53,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:47:53,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:47:53,763 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:47:53,785 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:53,822 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:53,845 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:53,869 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 19 treesize of output 11 [2024-10-19 08:47:53,909 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:53,940 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 19 treesize of output 11 [2024-10-19 08:47:53,983 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:47:54,008 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 19 treesize of output 11 [2024-10-19 08:47:54,031 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 19 treesize of output 11 [2024-10-19 08:47:54,070 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 19 treesize of output 11 [2024-10-19 08:47:54,123 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 19 treesize of output 11 [2024-10-19 08:47:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:47:54,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:47:54,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1827 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1827) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:47:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 3 times theorem prover too weak. 9 trivial. 7 not checked. [2024-10-19 08:47:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361417456] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:47:54,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:47:54,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 16 [2024-10-19 08:47:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473989216] [2024-10-19 08:47:54,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:47:54,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 08:47:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:47:54,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 08:47:54,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=186, Unknown=9, NotChecked=28, Total=272 [2024-10-19 08:47:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:54,478 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:47:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.705882352941176) internal successors, (182), 16 states have internal predecessors, (182), 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) [2024-10-19 08:47:54,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:54,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:47:59,396 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:47:59,396 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:47:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 302815763, now seen corresponding path program 1 times [2024-10-19 08:47:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:47:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:47:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:47:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:47:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 08:47:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-19 08:48:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:48:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 08:48:35,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:48:36,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-19 08:48:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:48:36,193 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:48:36,194 INFO L312 ceAbstractionStarter]: Result for error location t_funThread4of4ForFork0 was SAFE (1/5) [2024-10-19 08:48:36,196 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:48:36,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:48:36,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:48:36,198 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:48:36,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-19 08:48:36,242 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:48:36,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:48:36,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread2of4ForFork0 ======== [2024-10-19 08:48:36,245 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:48:36,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:48:37,842 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:37,843 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:48:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -408834590, now seen corresponding path program 1 times [2024-10-19 08:48:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:39,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:48:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:48:40,437 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:40,438 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:48:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1448999529, now seen corresponding path program 1 times [2024-10-19 08:48:40,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:40,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:40,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:40,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:48:40,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:48:40,873 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:40,874 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:48:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1851866812, now seen corresponding path program 1 times [2024-10-19 08:48:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:42,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:48:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:43,649 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:43,649 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:48:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash -632836829, now seen corresponding path program 1 times [2024-10-19 08:48:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:43,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:48:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:48:44,164 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:44,164 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:48:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1851866726, now seen corresponding path program 1 times [2024-10-19 08:48:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:44,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:48:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:44,413 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:48:44,414 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:48:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 840442736, now seen corresponding path program 1 times [2024-10-19 08:48:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:44,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:48:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:48:45,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:48:45,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:48:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1860006215, now seen corresponding path program 1 times [2024-10-19 08:48:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:48:45,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112547211] [2024-10-19 08:48:45,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:48:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:48:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112547211] [2024-10-19 08:48:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112547211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:48:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587569493] [2024-10-19 08:48:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:45,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:48:45,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:48:45,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:48:45,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-19 08:48:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:46,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-19 08:48:46,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:48:46,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:48:46,047 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:48:46,069 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:48:46,115 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:48:46,143 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:48:46,174 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 19 treesize of output 11 [2024-10-19 08:48:46,212 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:48:46,242 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 19 treesize of output 11 [2024-10-19 08:48:46,288 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:48:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:48:46,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:48:46,333 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2260) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:48:46,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2260) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:48:46,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (- 1) (select .cse0 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2260) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:48:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2024-10-19 08:48:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587569493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:48:46,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:48:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 14 [2024-10-19 08:48:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218922162] [2024-10-19 08:48:46,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:48:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 08:48:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:48:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 08:48:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=104, Unknown=3, NotChecked=66, Total=210 [2024-10-19 08:48:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:48:46,465 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:48:46,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 14 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) [2024-10-19 08:48:46,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:48:52,104 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:48:52,104 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:48:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1226046707, now seen corresponding path program 1 times [2024-10-19 08:48:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:48:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-19 08:48:53,227 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:48:53,227 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:48:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1220613100, now seen corresponding path program 1 times [2024-10-19 08:48:53,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:48:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:48:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:48:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:48:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 08:48:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-19 08:49:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 08:49:29,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:49:29,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-19 08:49:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-10-19 08:49:29,613 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:49:29,613 INFO L312 ceAbstractionStarter]: Result for error location t_funThread2of4ForFork0 was SAFE (2/5) [2024-10-19 08:49:29,618 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:49:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:49:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:49:29,620 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:49:29,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-10-19 08:49:29,658 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:49:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:49:29,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread3of4ForFork0 ======== [2024-10-19 08:49:29,662 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:49:29,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:49:31,476 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:31,477 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:49:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash -408830494, now seen corresponding path program 1 times [2024-10-19 08:49:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:49:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:49:32,062 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:32,062 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:49:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1448995433, now seen corresponding path program 1 times [2024-10-19 08:49:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:49:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:49:32,417 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:32,418 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:49:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1851862716, now seen corresponding path program 1 times [2024-10-19 08:49:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:32,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:49:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:33,158 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:33,159 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:49:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -632832733, now seen corresponding path program 1 times [2024-10-19 08:49:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:35,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:49:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:49:35,524 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:35,524 INFO L378 Elim1Store]: Elim1 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 2466 treesize of output 2182 [2024-10-19 08:49:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1851862630, now seen corresponding path program 1 times [2024-10-19 08:49:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:35,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:49:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:35,736 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:49:35,737 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:49:38,064 INFO L85 PathProgramCache]: Analyzing trace with hash 840446832, now seen corresponding path program 1 times [2024-10-19 08:49:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:38,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:49:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:49:39,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:49:39,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:49:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash -190268023, now seen corresponding path program 1 times [2024-10-19 08:49:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:49:39,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578460297] [2024-10-19 08:49:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:49:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:49:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578460297] [2024-10-19 08:49:39,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578460297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:49:39,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064874728] [2024-10-19 08:49:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:39,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:49:39,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:49:39,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:49:39,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-19 08:49:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:40,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-19 08:49:40,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:49:40,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:49:40,073 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:49:40,092 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:49:40,128 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:49:40,153 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:49:40,179 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 19 treesize of output 11 [2024-10-19 08:49:40,210 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:49:40,237 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 19 treesize of output 11 [2024-10-19 08:49:40,288 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:49:40,316 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 19 treesize of output 11 [2024-10-19 08:49:40,342 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 19 treesize of output 11 [2024-10-19 08:49:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-19 08:49:40,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:49:40,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2893 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2893) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:49:40,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2893 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2893) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:49:40,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2890 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2890) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2893) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:49:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2024-10-19 08:49:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064874728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:49:40,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:49:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 16 [2024-10-19 08:49:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87308980] [2024-10-19 08:49:40,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:49:40,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 08:49:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:49:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 08:49:40,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=146, Unknown=3, NotChecked=78, Total=272 [2024-10-19 08:49:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:49:40,661 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:49:40,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 08:49:40,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:49:44,476 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:49:44,476 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:49:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 302823526, now seen corresponding path program 1 times [2024-10-19 08:49:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:49:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:49:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:49:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:49:44,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 08:49:44,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-19 08:50:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 08:50:19,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:50:19,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-19 08:50:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable89,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:50:20,126 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:50:20,126 INFO L312 ceAbstractionStarter]: Result for error location t_funThread3of4ForFork0 was SAFE (3/5) [2024-10-19 08:50:20,128 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:50:20,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:50:20,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:50:20,130 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:50:20,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-19 08:50:20,168 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:50:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:50:20,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of4ForFork0 ======== [2024-10-19 08:50:20,172 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:50:20,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:50:21,860 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:21,860 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:50:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -408826713, now seen corresponding path program 1 times [2024-10-19 08:50:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:21,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:50:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:50:22,360 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:22,361 INFO L378 Elim1Store]: Elim1 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 2354 treesize of output 2070 [2024-10-19 08:50:22,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1448991652, now seen corresponding path program 1 times [2024-10-19 08:50:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:50:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:50:22,666 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:22,666 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:50:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1851858935, now seen corresponding path program 1 times [2024-10-19 08:50:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:22,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:23,372 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:23,372 INFO L378 Elim1Store]: Elim1 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 2466 treesize of output 2182 [2024-10-19 08:50:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -632828952, now seen corresponding path program 1 times [2024-10-19 08:50:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:23,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:50:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:50:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:50:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:50:23,664 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:23,665 INFO L378 Elim1Store]: Elim1 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 2354 treesize of output 2070 [2024-10-19 08:50:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1851858849, now seen corresponding path program 1 times [2024-10-19 08:50:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:25,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:25,926 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:25,927 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:50:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash 840450613, now seen corresponding path program 1 times [2024-10-19 08:50:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:28,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:31,068 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:31,068 INFO L378 Elim1Store]: Elim1 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 2354 treesize of output 2070 [2024-10-19 08:50:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1321498215, now seen corresponding path program 1 times [2024-10-19 08:50:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,313 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:33,313 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:50:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1816341395, now seen corresponding path program 1 times [2024-10-19 08:50:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,578 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:33,579 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:50:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 699731889, now seen corresponding path program 1 times [2024-10-19 08:50:33,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:33,882 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:33,883 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:50:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1455415762, now seen corresponding path program 1 times [2024-10-19 08:50:34,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:34,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:34,239 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:34,240 INFO L378 Elim1Store]: Elim1 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 629 treesize of output 561 [2024-10-19 08:50:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1206087470, now seen corresponding path program 1 times [2024-10-19 08:50:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:34,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:34,470 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:34,470 INFO L378 Elim1Store]: Elim1 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 2562 treesize of output 2278 [2024-10-19 08:50:36,568 INFO L85 PathProgramCache]: Analyzing trace with hash 780624225, now seen corresponding path program 1 times [2024-10-19 08:50:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:36,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:36,845 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 27 [2024-10-19 08:50:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -792364897, now seen corresponding path program 1 times [2024-10-19 08:50:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:38,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:39,189 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:39,190 INFO L378 Elim1Store]: Elim1 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 2562 treesize of output 2278 [2024-10-19 08:50:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash -871725107, now seen corresponding path program 1 times [2024-10-19 08:50:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:39,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:39,471 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:39,471 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:50:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 234209380, now seen corresponding path program 1 times [2024-10-19 08:50:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:41,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:41,852 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 27 [2024-10-19 08:50:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -28107104, now seen corresponding path program 1 times [2024-10-19 08:50:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:42,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:42,274 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 27 [2024-10-19 08:50:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 853868972, now seen corresponding path program 1 times [2024-10-19 08:50:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:42,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:42,578 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:42,578 INFO L378 Elim1Store]: Elim1 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 1160 treesize of output 1020 [2024-10-19 08:50:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 888101845, now seen corresponding path program 1 times [2024-10-19 08:50:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:44,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:44,781 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:44,781 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:50:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash -639232534, now seen corresponding path program 1 times [2024-10-19 08:50:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:46,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:46,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:47,021 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:47,022 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:50:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 919978116, now seen corresponding path program 1 times [2024-10-19 08:50:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:49,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:49,278 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:49,279 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:50:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1277805689, now seen corresponding path program 1 times [2024-10-19 08:50:49,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:49,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:49,627 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 27 [2024-10-19 08:50:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1692257781, now seen corresponding path program 1 times [2024-10-19 08:50:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:51,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:51,893 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:51,893 INFO L378 Elim1Store]: Elim1 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 1260 treesize of output 1120 [2024-10-19 08:50:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1612897567, now seen corresponding path program 1 times [2024-10-19 08:50:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:52,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:52,132 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:52,132 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:50:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1412320464, now seen corresponding path program 1 times [2024-10-19 08:50:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:52,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:52,778 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 27 [2024-10-19 08:50:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -502147284, now seen corresponding path program 1 times [2024-10-19 08:50:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:54,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:55,084 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 27 [2024-10-19 08:50:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1275587448, now seen corresponding path program 1 times [2024-10-19 08:50:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:57,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:57,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:57,294 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:57,295 INFO L378 Elim1Store]: Elim1 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 1260 treesize of output 1120 [2024-10-19 08:50:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -315905475, now seen corresponding path program 1 times [2024-10-19 08:50:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:57,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:57,538 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:57,538 INFO L378 Elim1Store]: Elim1 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 613 treesize of output 545 [2024-10-19 08:50:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash -611786107, now seen corresponding path program 1 times [2024-10-19 08:50:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:50:57,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:50:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:57,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:50:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:50:58,033 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:50:58,034 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:51:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 111179838, now seen corresponding path program 1 times [2024-10-19 08:51:00,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,305 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 27 [2024-10-19 08:51:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1543742662, now seen corresponding path program 1 times [2024-10-19 08:51:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,632 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 27 [2024-10-19 08:51:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1257103376, now seen corresponding path program 1 times [2024-10-19 08:51:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:00,898 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:00,898 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:51:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash -822483134, now seen corresponding path program 1 times [2024-10-19 08:51:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:01,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:01,139 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:01,139 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:51:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1939318847, now seen corresponding path program 1 times [2024-10-19 08:51:03,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:03,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:03,486 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 27 [2024-10-19 08:51:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash 389123325, now seen corresponding path program 1 times [2024-10-19 08:51:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:05,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:05,803 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 27 [2024-10-19 08:51:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash -735352543, now seen corresponding path program 1 times [2024-10-19 08:51:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:07,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:08,915 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:08,915 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1919336226, now seen corresponding path program 1 times [2024-10-19 08:51:11,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:11,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:11,150 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:11,150 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:51:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1018457331, now seen corresponding path program 1 times [2024-10-19 08:51:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:13,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:13,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:13,389 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:13,389 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:51:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1368612034, now seen corresponding path program 1 times [2024-10-19 08:51:15,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:15,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:15,617 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:15,618 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:17,712 INFO L85 PathProgramCache]: Analyzing trace with hash 700429070, now seen corresponding path program 1 times [2024-10-19 08:51:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:17,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:17,994 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 27 [2024-10-19 08:51:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1895527082, now seen corresponding path program 1 times [2024-10-19 08:51:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:20,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:20,302 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:20,302 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -576520868, now seen corresponding path program 1 times [2024-10-19 08:51:22,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:22,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:22,555 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:22,555 INFO L378 Elim1Store]: Elim1 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 2466 treesize of output 2182 [2024-10-19 08:51:25,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1230989006, now seen corresponding path program 1 times [2024-10-19 08:51:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:25,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:26,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:26,243 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 27 [2024-10-19 08:51:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1505436430, now seen corresponding path program 1 times [2024-10-19 08:51:28,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:28,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:28,545 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 27 [2024-10-19 08:51:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 477569255, now seen corresponding path program 1 times [2024-10-19 08:51:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:30,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:30,807 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:30,808 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 960347710, now seen corresponding path program 1 times [2024-10-19 08:51:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:30,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:30,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:31,056 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:31,057 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:51:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1810396240, now seen corresponding path program 1 times [2024-10-19 08:51:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:33,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:33,446 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 27 [2024-10-19 08:51:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1908670452, now seen corresponding path program 1 times [2024-10-19 08:51:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:35,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:35,676 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:35,676 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:51:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1874437583, now seen corresponding path program 1 times [2024-10-19 08:51:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:37,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:37,925 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:37,926 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:51:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1887818255, now seen corresponding path program 1 times [2024-10-19 08:51:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:40,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:40,430 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 27 [2024-10-19 08:51:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -753189141, now seen corresponding path program 1 times [2024-10-19 08:51:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:40,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:44,689 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:51:44,689 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:51:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 423897395, now seen corresponding path program 1 times [2024-10-19 08:51:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:51:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:51:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:51:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:51:45,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 08:51:45,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-19 08:51:45,179 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:45,179 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1851857604, now seen corresponding path program 1 times [2024-10-19 08:51:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:47,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:47,455 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:47,455 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:51:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash 840451852, now seen corresponding path program 1 times [2024-10-19 08:51:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:47,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:49,912 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:49,913 INFO L378 Elim1Store]: Elim1 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 601 treesize of output 533 [2024-10-19 08:51:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1358400551, now seen corresponding path program 1 times [2024-10-19 08:51:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:52,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:52,326 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:52,326 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:51:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1331723908, now seen corresponding path program 1 times [2024-10-19 08:51:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:52,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:53,688 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:51:53,688 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:51:55,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1428864516, now seen corresponding path program 1 times [2024-10-19 08:51:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:51:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:51:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:55,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:51:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:51:58,576 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 27 [2024-10-19 08:52:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -225947086, now seen corresponding path program 1 times [2024-10-19 08:52:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:00,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:00,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:52:00,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:00,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1895167022, now seen corresponding path program 1 times [2024-10-19 08:52:00,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:52:00,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283750970] [2024-10-19 08:52:00,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:00,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:52:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:52:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283750970] [2024-10-19 08:52:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283750970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:52:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307305783] [2024-10-19 08:52:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:52:01,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:52:01,018 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:52:01,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-19 08:52:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:01,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 08:52:01,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:52:01,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:52:01,354 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:52:01,379 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:01,438 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 08:52:01,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:52:01,531 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6069 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6069) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:52:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-19 08:52:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307305783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:52:01,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:52:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-19 08:52:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714180510] [2024-10-19 08:52:01,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:52:01,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-19 08:52:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:52:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-19 08:52:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=65, Unknown=1, NotChecked=16, Total=110 [2024-10-19 08:52:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:01,584 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:52:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2024-10-19 08:52:01,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:52:09,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-19 08:52:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:52:09,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:52:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1700575633, now seen corresponding path program 1 times [2024-10-19 08:52:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:52:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383642478] [2024-10-19 08:52:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-19 08:52:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:52:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383642478] [2024-10-19 08:52:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383642478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:52:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849824191] [2024-10-19 08:52:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:52:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:52:10,020 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:52:10,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-19 08:52:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:10,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-19 08:52:10,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:52:10,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:52:10,432 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:52:10,463 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:10,505 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:10,625 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:10,706 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:10,771 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 19 treesize of output 11 [2024-10-19 08:52:10,860 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:10,923 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 19 treesize of output 11 [2024-10-19 08:52:11,013 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 19 treesize of output 11 [2024-10-19 08:52:11,042 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 19 treesize of output 11 [2024-10-19 08:52:11,114 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 19 treesize of output 11 [2024-10-19 08:52:11,144 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 19 treesize of output 11 [2024-10-19 08:52:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-19 08:52:11,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:52:11,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6212 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6212) |c_~#A~0.base|) |c_~#A~0.offset|))) is different from false [2024-10-19 08:52:11,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6212 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6212) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2024-10-19 08:52:11,383 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6212 (Array Int Int)) (v_ArrVal_6209 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6209) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6212) |c_~#A~0.base|) |c_~#A~0.offset|) 1)) is different from false [2024-10-19 08:52:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 14 not checked. [2024-10-19 08:52:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849824191] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:52:11,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:52:11,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2024-10-19 08:52:11,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212318761] [2024-10-19 08:52:11,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:52:11,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-19 08:52:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:52:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-19 08:52:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=146, Unknown=3, NotChecked=78, Total=272 [2024-10-19 08:52:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:11,569 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:52:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.647058823529411) internal successors, (181), 16 states have internal predecessors, (181), 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) [2024-10-19 08:52:11,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:52:11,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 08:52:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-19 08:52:41,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-19 08:52:41,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-19 08:52:41,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:52:41,665 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:52:41,666 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of4ForFork0 was SAFE (4/5) [2024-10-19 08:52:41,668 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:52:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:52:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:52:41,670 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:52:41,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-10-19 08:52:41,709 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:52:41,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:41,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 08:52:41,713 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:52:41,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-19 08:52:42,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:52:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash -115645268, now seen corresponding path program 1 times [2024-10-19 08:52:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:52:42,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137997010] [2024-10-19 08:52:42,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:42,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-19 08:52:42,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:52:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137997010] [2024-10-19 08:52:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137997010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 08:52:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 08:52:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 08:52:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547246151] [2024-10-19 08:52:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 08:52:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-19 08:52:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:52:42,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:52:42,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:52:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:42,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:52:42,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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) [2024-10-19 08:52:42,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:43,029 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:43,030 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:52:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1448986878, now seen corresponding path program 1 times [2024-10-19 08:52:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:52:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:52:43,633 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:43,634 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:52:43,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1851854161, now seen corresponding path program 1 times [2024-10-19 08:52:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:43,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:44,436 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:44,436 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:52:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -632824178, now seen corresponding path program 1 times [2024-10-19 08:52:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:45,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:52:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:52:46,044 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:46,045 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:52:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1851854075, now seen corresponding path program 1 times [2024-10-19 08:52:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:46,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:46,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:46,453 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:46,453 INFO L378 Elim1Store]: Elim1 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 2562 treesize of output 2278 [2024-10-19 08:52:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 840455387, now seen corresponding path program 1 times [2024-10-19 08:52:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:46,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:47,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable160,SelfDestructingSolverStorable161,SelfDestructingSolverStorable159,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-10-19 08:52:47,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 08:52:47,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1645459477, now seen corresponding path program 1 times [2024-10-19 08:52:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:52:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407762901] [2024-10-19 08:52:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:47,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:47,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-19 08:52:47,125 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-19 08:52:47,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-19 08:52:47,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-19 08:52:47,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-10-19 08:52:47,127 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-19 08:52:47,127 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (5/5) [2024-10-19 08:52:47,127 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-19 08:52:47,127 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-19 08:52:47,150 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-19 08:52:47,153 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 08:52:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 08:52:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:52:47,155 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-19 08:52:47,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-19 08:52:47,202 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 08:52:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:47,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread3of5ForFork0 ======== [2024-10-19 08:52:47,206 INFO L333 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, 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;@20f4f160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 08:52:47,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 08:52:49,176 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:49,176 INFO L378 Elim1Store]: Elim1 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 1292 treesize of output 1152 [2024-10-19 08:52:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1470498172, now seen corresponding path program 1 times [2024-10-19 08:52:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:49,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-19 08:52:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-19 08:52:49,817 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:49,818 INFO L378 Elim1Store]: Elim1 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 1216 treesize of output 1076 [2024-10-19 08:52:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1247869361, now seen corresponding path program 1 times [2024-10-19 08:52:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 08:52:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 08:52:50,212 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:50,213 INFO L378 Elim1Store]: Elim1 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 613 treesize of output 545 [2024-10-19 08:52:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1074689214, now seen corresponding path program 1 times [2024-10-19 08:52:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:50,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:51,240 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:51,241 INFO L378 Elim1Store]: Elim1 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 1212 treesize of output 1072 [2024-10-19 08:52:51,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1894673987, now seen corresponding path program 1 times [2024-10-19 08:52:51,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:52:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 08:52:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-19 08:52:51,688 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:51,689 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:52:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1074689308, now seen corresponding path program 1 times [2024-10-19 08:52:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:53,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:54,017 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 08:52:54,017 INFO L378 Elim1Store]: Elim1 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 1276 treesize of output 1136 [2024-10-19 08:52:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 18040874, now seen corresponding path program 1 times [2024-10-19 08:52:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:54,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 08:52:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 08:52:56,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 08:52:56,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 08:52:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash -926668443, now seen corresponding path program 1 times [2024-10-19 08:52:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 08:52:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480048596] [2024-10-19 08:52:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:52:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 08:52:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 08:52:56,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480048596] [2024-10-19 08:52:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480048596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 08:52:56,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807167546] [2024-10-19 08:52:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:52:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 08:52:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 08:52:56,546 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 08:52:56,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-19 08:52:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:52:56,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-19 08:52:56,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 08:52:56,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 08:52:56,962 INFO L378 Elim1Store]: Elim1 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 [2024-10-19 08:52:56,989 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,057 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,098 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,153 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 19 treesize of output 11 [2024-10-19 08:52:57,207 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,247 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 19 treesize of output 11 [2024-10-19 08:52:57,324 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,371 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-19 08:52:57,409 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 19 treesize of output 11 [2024-10-19 08:52:57,453 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 19 treesize of output 11 [2024-10-19 08:52:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 08:52:57,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 08:52:57,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6774 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6774) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:52:57,642 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6774 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6774) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:52:57,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6770 (Array Int Int)) (v_ArrVal_6774 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6770) |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (- 1) (select .cse0 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_6774) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2024-10-19 08:52:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 29 not checked. [2024-10-19 08:52:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807167546] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 08:52:57,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 08:52:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10] total 18 [2024-10-19 08:52:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243460960] [2024-10-19 08:52:57,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 08:52:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-19 08:52:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 08:52:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-19 08:52:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=190, Unknown=8, NotChecked=90, Total=342 [2024-10-19 08:52:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:52:57,930 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 08:52:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.947368421052632) internal successors, (170), 18 states have internal predecessors, (170), 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) [2024-10-19 08:52:57,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 08:53:04,614 INFO L349 Elim1Store]: treesize reduction 11, result has 26.7 percent of original size [2024-10-19 08:53:04,614 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-10-19 08:53:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1567267981, now seen corresponding path program 1 times [2024-10-19 08:53:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:53:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:53:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:53:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:53:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 08:53:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 08:53:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 08:53:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 08:53:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-19 08:53:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110