./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:55:53,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:55:53,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-21 19:55:53,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:55:53,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:55:54,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:55:54,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:55:54,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:55:54,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:55:54,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:55:54,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:55:54,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:55:54,010 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:55:54,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:55:54,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:55:54,011 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:55:54,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:55:54,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:55:54,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:55:54,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:55:54,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:55:54,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:55:54,013 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:55:54,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:55:54,014 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:55:54,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:55:54,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:55:54,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 19:55:54,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:55:54,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:55:54,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:55:54,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:55:54,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:55:54,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:55:54,016 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-21 19:55:54,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:55:54,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:55:54,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:55:54,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:55:54,017 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:55:54,017 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:55:54,017 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-11-21 19:55:54,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:55:54,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:55:54,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:55:54,248 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:55:54,249 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:55:54,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-21 19:55:55,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:55:55,659 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:55:55,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-21 19:55:55,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/03ff75f34/0ef887203c6546bab4914d40f0bcf8a9/FLAGd6fd84a4d [2023-11-21 19:55:55,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/03ff75f34/0ef887203c6546bab4914d40f0bcf8a9 [2023-11-21 19:55:55,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:55:55,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:55:55,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:55:55,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:55:55,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:55:55,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:55:55" (1/1) ... [2023-11-21 19:55:55,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e301594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:55, skipping insertion in model container [2023-11-21 19:55:55,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:55:55" (1/1) ... [2023-11-21 19:55:55,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:55:55,989 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:55:56,169 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-21 19:55:56,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:55:56,190 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:55:56,216 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:55:56,249 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-21 19:55:56,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:55:56,317 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:55:56,320 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:55:56,320 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:55:56,327 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:55:56,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56 WrapperNode [2023-11-21 19:55:56,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:55:56,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:55:56,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:55:56,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:55:56,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,387 INFO L138 Inliner]: procedures = 171, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-21 19:55:56,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:55:56,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:55:56,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:55:56,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:55:56,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:55:56,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:55:56,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:55:56,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:55:56,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (1/1) ... [2023-11-21 19:55:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:55:56,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:55:56,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:55:56,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:55:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 19:55:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-21 19:55:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-21 19:55:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 19:55:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 19:55:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 19:55:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:55:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:55:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 19:55:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 19:55:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:55:56,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:55:56,533 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:55:56,675 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:55:56,677 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:55:56,803 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:55:56,951 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:55:56,951 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:55:56,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:55:56 BoogieIcfgContainer [2023-11-21 19:55:56,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:55:56,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:55:56,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:55:56,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:55:56,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:55:55" (1/3) ... [2023-11-21 19:55:56,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc2b195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:55:56, skipping insertion in model container [2023-11-21 19:55:56,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:55:56" (2/3) ... [2023-11-21 19:55:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc2b195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:55:56, skipping insertion in model container [2023-11-21 19:55:56,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:55:56" (3/3) ... [2023-11-21 19:55:56,962 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-21 19:55:56,971 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:55:56,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:55:56,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-21 19:55:56,981 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:55:57,027 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:55:57,068 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:55:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:55:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:55:57,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:55:57,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 19:55:57,117 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:55:57,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-21 19:55:57,137 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@366d834f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:55:57,137 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:55:57,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:55:57,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:55:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 19561318, now seen corresponding path program 1 times [2023-11-21 19:55:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:55:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638908628] [2023-11-21 19:55:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:55:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:55:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:55:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:55:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:55:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638908628] [2023-11-21 19:55:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638908628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:55:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:55:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:55:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759664376] [2023-11-21 19:55:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:55:57,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:55:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:55:57,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:55:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:55:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:57,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:55:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:55:57,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:57,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:55:57,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:55:57,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:55:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash 691933217, now seen corresponding path program 1 times [2023-11-21 19:55:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:55:57,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069173814] [2023-11-21 19:55:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:55:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:55:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:55:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:55:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:55:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069173814] [2023-11-21 19:55:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069173814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:55:58,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:55:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 19:55:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56474829] [2023-11-21 19:55:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:55:58,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-21 19:55:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:55:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 19:55:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-21 19:55:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:58,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:55:58,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:55:58,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:58,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:55:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:55:58,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:55:58,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:55:58,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:55:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash -833348320, now seen corresponding path program 1 times [2023-11-21 19:55:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:55:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129643181] [2023-11-21 19:55:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:55:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:55:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:55:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:55:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:55:59,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129643181] [2023-11-21 19:55:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129643181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:55:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537983758] [2023-11-21 19:55:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:55:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:55:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:55:59,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:55:59,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:55:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:55:59,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 19:55:59,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:55:59,382 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 19:55:59,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 19:55:59,404 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 [2023-11-21 19:55:59,432 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 19:55:59,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-21 19:55:59,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:55:59,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2023-11-21 19:55:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2023-11-21 19:55:59,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 19 [2023-11-21 19:55:59,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 19:55:59,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-21 19:56:07,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2023-11-21 19:56:07,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-21 19:56:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:08,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:56:08,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse1))))) (store .cse2 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse0 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< (mod .cse1 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2023-11-21 19:56:08,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-11-21 19:56:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 19:56:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537983758] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:56:09,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:56:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 32 [2023-11-21 19:56:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001905441] [2023-11-21 19:56:09,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:56:09,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:56:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:09,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:56:09,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=764, Unknown=32, NotChecked=122, Total=1122 [2023-11-21 19:56:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:09,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:09,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:09,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:09,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:56:09,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:09,226 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)) (.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse7 (mod (select .cse10 |c_~#value~0.offset|) 4294967296)))) (and (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_67 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse6 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 0) (or (not .cse5) (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse8 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| 3)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1)))) is different from false [2023-11-21 19:56:11,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)) (.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse7 (mod (select .cse10 |c_~#value~0.offset|) 4294967296)))) (and (forall ((v_ArrVal_67 (Array Int Int)) (|thr1Thread1of1ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 0)))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (let ((.cse1 (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (v_ArrVal_67 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse6 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 0) (or (forall ((v_ArrVal_67 (Array Int Int))) (let ((.cse8 (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_67))) (or (= (mod (select (select .cse8 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse5)) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of1ForFork0_~#casret~0#1.base| 3))))) is different from false [2023-11-21 19:56:25,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 19:56:27,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 19:56:29,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 19:56:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:56:30,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 19:56:30,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-21 19:56:30,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 19:56:30,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-21 19:56:30,518 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 19:56:30,521 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-11-21 19:56:30,524 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:30,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:56:30,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:56:30,527 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) [2023-11-21 19:56:30,528 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 [2023-11-21 19:56:30,546 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:56:30,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:56:30,546 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@366d834f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:30,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:56:30,591 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:30,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1618562975, now seen corresponding path program 1 times [2023-11-21 19:56:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993882399] [2023-11-21 19:56:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993882399] [2023-11-21 19:56:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993882399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:30,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:56:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364720745] [2023-11-21 19:56:30,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:30,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:56:30,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:30,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:56:30,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:56:30,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:30,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:30,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 19:56:30,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:30,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -772103782, now seen corresponding path program 1 times [2023-11-21 19:56:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610493324] [2023-11-21 19:56:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:30,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610493324] [2023-11-21 19:56:30,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610493324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 19:56:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229621555] [2023-11-21 19:56:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 19:56:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 19:56:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:56:30,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:30,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2023-11-21 19:56:30,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:30,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 19:56:31,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 19:56:31,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:31,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1039098973, now seen corresponding path program 1 times [2023-11-21 19:56:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659224626] [2023-11-21 19:56:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:56:31,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:56:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:56:31,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:56:31,216 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:56:31,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-21 19:56:31,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 19:56:31,218 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 19:56:31,219 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-21 19:56:31,219 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:56:31,220 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 19:56:31,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:56:31,236 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:31,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:56:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:56:31,238 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) [2023-11-21 19:56:31,243 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:56:31,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:56:31,244 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@366d834f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:31,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:56:31,258 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 [2023-11-21 19:56:31,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:31,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1017308915, now seen corresponding path program 1 times [2023-11-21 19:56:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:31,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386147323] [2023-11-21 19:56:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:31,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 19:56:31,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386147323] [2023-11-21 19:56:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386147323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:56:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94564818] [2023-11-21 19:56:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:31,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:56:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:56:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:56:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:31,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:31,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 19:56:31,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:31,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 335739395, now seen corresponding path program 1 times [2023-11-21 19:56:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194142123] [2023-11-21 19:56:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 19:56:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194142123] [2023-11-21 19:56:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194142123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:31,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 19:56:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823377401] [2023-11-21 19:56:31,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:31,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 19:56:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:31,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 19:56:31,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-21 19:56:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:31,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:31,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:31,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:56:32,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 19:56:32,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:32,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash -968851834, now seen corresponding path program 1 times [2023-11-21 19:56:32,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:32,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114537383] [2023-11-21 19:56:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114537383] [2023-11-21 19:56:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114537383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:56:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970595568] [2023-11-21 19:56:32,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:32,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:56:32,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:56:32,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:56:32,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 19:56:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:32,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 19:56:32,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:56:32,795 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:56:32,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 19:56:32,818 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 [2023-11-21 19:56:32,845 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:56:32,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 19:56:32,939 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-21 19:56:32,942 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 [2023-11-21 19:56:33,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-21 19:56:33,047 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 [2023-11-21 19:56:33,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:56:33,074 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 [2023-11-21 19:56:33,154 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-21 19:56:33,157 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 [2023-11-21 19:56:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:33,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:56:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970595568] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:56:41,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:56:41,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2023-11-21 19:56:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985941461] [2023-11-21 19:56:41,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:56:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 19:56:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:41,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 19:56:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1148, Unknown=37, NotChecked=0, Total=1406 [2023-11-21 19:56:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:41,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:41,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:56:41,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:56:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-21 19:56:41,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-21 19:56:42,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-21 19:56:42,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-21 19:56:42,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 942770601, now seen corresponding path program 1 times [2023-11-21 19:56:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279652022] [2023-11-21 19:56:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:56:42,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:56:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:56:42,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:56:42,253 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:56:42,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-21 19:56:42,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:56:42,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 19:56:42,256 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-21 19:56:42,257 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:56:42,257 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-21 19:56:42,275 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 19:56:42,277 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:42,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:56:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:56:42,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:56:42,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-11-21 19:56:42,290 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:56:42,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-21 19:56:42,291 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@366d834f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:56:42,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:56:42,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:56:42,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1398027588, now seen corresponding path program 1 times [2023-11-21 19:56:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755504307] [2023-11-21 19:56:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 19:56:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755504307] [2023-11-21 19:56:42,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755504307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:42,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:42,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:56:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032927445] [2023-11-21 19:56:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:42,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:56:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:42,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:56:42,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:56:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:42,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:42,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:42,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:42,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:56:42,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:56:42,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1765456501, now seen corresponding path program 1 times [2023-11-21 19:56:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872885441] [2023-11-21 19:56:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 19:56:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:43,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872885441] [2023-11-21 19:56:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872885441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:56:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:56:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 19:56:43,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365294393] [2023-11-21 19:56:43,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:56:43,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-21 19:56:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:56:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-21 19:56:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-21 19:56:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:43,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:56:43,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:56:43,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:43,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:56:43,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:56:43,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:56:43,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:56:43,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:56:43,492 INFO L85 PathProgramCache]: Analyzing trace with hash -923542824, now seen corresponding path program 1 times [2023-11-21 19:56:43,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:56:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876009602] [2023-11-21 19:56:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:56:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 19:56:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:56:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876009602] [2023-11-21 19:56:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876009602] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:56:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617247186] [2023-11-21 19:56:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:56:43,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:56:43,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:56:43,981 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) [2023-11-21 19:56:44,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 19:56:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:56:44,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 19:56:44,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:56:44,104 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 19:56:44,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 19:56:44,140 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 [2023-11-21 19:56:44,181 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-21 19:56:44,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-21 19:56:44,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-21 19:56:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-21 19:56:44,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-21 19:56:44,624 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 19:56:44,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-21 19:56:44,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-11-21 19:56:44,830 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:56:44,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-11-21 19:56:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:56:44,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:57:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:57:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617247186] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:57:00,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:57:00,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 31 [2023-11-21 19:57:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131584085] [2023-11-21 19:57:00,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:57:00,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-21 19:57:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:57:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-21 19:57:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=802, Unknown=41, NotChecked=0, Total=992 [2023-11-21 19:57:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:00,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:57:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:57:00,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:00,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:57:00,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:57:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 19:57:02,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 19:57:02,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-21 19:57:02,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:57:02,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:57:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1217756251, now seen corresponding path program 1 times [2023-11-21 19:57:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:57:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961702366] [2023-11-21 19:57:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:57:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:57:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:57:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 19:57:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:57:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961702366] [2023-11-21 19:57:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961702366] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:57:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843807490] [2023-11-21 19:57:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:57:03,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:57:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:57:03,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:57:03,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 19:57:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:57:03,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 19:57:03,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:57:03,286 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 19:57:03,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 19:57:03,321 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 [2023-11-21 19:57:03,372 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-21 19:57:03,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-21 19:57:03,543 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-21 19:57:03,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:57:03,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-21 19:57:03,729 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 [2023-11-21 19:57:03,775 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-11-21 19:57:03,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-11-21 19:57:03,942 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-21 19:57:03,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 19:57:04,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-21 19:57:04,139 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 [2023-11-21 19:57:04,204 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 19:57:04,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-21 19:57:04,321 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-21 19:57:04,326 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 [2023-11-21 19:57:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:57:04,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:57:06,622 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse4 |c_~#value~0.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse3))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14))) (or (let ((.cse1 (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439) |c_~#value~0.base|))) (let ((.cse0 (select .cse1 |c_~#value~0.offset|))) (< (mod .cse0 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_439) |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_438) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1))))))) is different from false [2023-11-21 19:57:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-21 19:57:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843807490] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:57:42,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:57:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 47 [2023-11-21 19:57:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743729124] [2023-11-21 19:57:42,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:57:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-21 19:57:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:57:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 19:57:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1878, Unknown=75, NotChecked=92, Total=2352 [2023-11-21 19:57:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:42,565 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:57:42,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 48 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:57:42,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:42,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:57:42,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 19:57:42,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:57:55,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:58:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:58:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:58:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 19:58:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:58:18,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 19:58:19,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:58:19,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 19:58:19,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:58:19,133 INFO L85 PathProgramCache]: Analyzing trace with hash 89922600, now seen corresponding path program 1 times [2023-11-21 19:58:19,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:58:19,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908272377] [2023-11-21 19:58:19,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:58:19,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:58:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:58:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-21 19:58:21,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:58:21,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908272377] [2023-11-21 19:58:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908272377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:58:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601750069] [2023-11-21 19:58:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:58:21,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:58:21,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:58:21,254 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:58:21,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 19:58:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:58:21,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-21 19:58:21,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:58:21,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:58:21,596 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:58:21,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 19:58:21,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-21 19:58:22,016 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 19:58:22,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 19:58:22,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-21 19:58:22,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 19:58:22,405 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 [2023-11-21 19:58:22,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-21 19:58:22,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 19:58:22,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2023-11-21 19:58:22,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2023-11-21 19:58:23,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2023-11-21 19:58:23,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2023-11-21 19:58:23,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 19:58:23,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 19:58:23,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 19:58:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-21 19:58:23,275 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:58:26,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse1 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse2 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_549 Int) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_549)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse2) (or (forall ((v_ArrVal_549 Int) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_549)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (not .cse2))))) (or .cse0 (forall ((v_DerPreprocessor_22 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_553) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) is different from false [2023-11-21 19:58:26,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-21 19:58:26,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:58:26,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-21 19:58:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 4 refuted. 2 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-21 19:58:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601750069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:58:26,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:58:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 25 [2023-11-21 19:58:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3929012] [2023-11-21 19:58:26,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:58:26,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-21 19:58:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:58:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 19:58:26,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=476, Unknown=12, NotChecked=44, Total=600 [2023-11-21 19:58:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:58:26,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:58:26,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.68) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 19:58:26,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:58:26,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 19:58:26,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-21 19:58:26,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:58:26,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:59:32,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:59:34,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:59:47,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 19:59:57,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 20:00:05,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-21 20:00:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:00:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 20:00:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 20:00:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-21 20:00:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-21 20:00:12,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-21 20:00:12,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-21 20:00:12,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:00:12,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:00:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1502622210, now seen corresponding path program 1 times [2023-11-21 20:00:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:00:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632646534] [2023-11-21 20:00:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:00:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:00:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:00:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:00:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:00:20,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632646534] [2023-11-21 20:00:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632646534] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:00:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225590568] [2023-11-21 20:00:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:00:20,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:00:20,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:00:20,562 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:00:20,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 20:00:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:00:20,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 20:00:20,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:00:20,796 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 20:00:20,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-21 20:00:21,334 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-21 20:00:21,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-21 20:00:22,071 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 20:00:22,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2023-11-21 20:00:22,360 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-21 20:00:22,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-11-21 20:00:23,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2023-11-21 20:00:23,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-21 20:00:23,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:00:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-21 20:00:23,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:00:23,805 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 45 treesize of output 45 [2023-11-21 20:00:23,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2023-11-21 20:00:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2023-11-21 20:00:23,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 20:00:23,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 20:00:23,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 20:00:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 20:00:24,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:00:24,973 WARN L854 $PredicateComparison]: unable to prove that (and (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) (forall ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_26) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) (forall ((v_DerPreprocessor_28 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) is different from false Killed by 15