./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread/queue_ok_longest.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 12:45:17,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 12:45:17,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-11 12:45:17,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 12:45:17,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 12:45:17,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 12:45:17,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 12:45:17,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 12:45:17,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 12:45:17,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 12:45:17,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 12:45:17,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 12:45:17,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 12:45:17,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 12:45:17,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 12:45:17,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 12:45:17,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 12:45:17,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 12:45:17,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 12:45:17,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 12:45:17,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 12:45:17,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 12:45:17,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 12:45:17,783 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-11 12:45:17,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 12:45:17,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 12:45:17,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 12:45:17,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 12:45:17,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 12:45:17,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 12:45:17,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 12:45:17,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 12:45:17,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:45:17,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 12:45:17,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 12:45:17,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 12:45:17,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 12:45:17,787 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-11 12:45:17,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 12:45:17,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 12:45:17,788 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 12:45:17,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 12:45:17,788 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 12:45:17,788 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 12:45:17,788 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 ! overflow) ) 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2024-11-11 12:45:18,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 12:45:18,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 12:45:18,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 12:45:18,088 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 12:45:18,089 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 12:45:18,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_ok_longest.i [2024-11-11 12:45:19,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 12:45:19,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 12:45:19,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longest.i [2024-11-11 12:45:19,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7babd71a9/77b4fdb2f7d443a1b98f503f27dd4bf0/FLAGd5dd5bb60 [2024-11-11 12:45:19,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7babd71a9/77b4fdb2f7d443a1b98f503f27dd4bf0 [2024-11-11 12:45:19,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 12:45:19,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 12:45:19,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:19,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 12:45:19,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 12:45:19,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:19" (1/1) ... [2024-11-11 12:45:19,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4659bc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:19, skipping insertion in model container [2024-11-11 12:45:19,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:19" (1/1) ... [2024-11-11 12:45:19,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 12:45:20,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:20,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 12:45:20,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:20,646 INFO L204 MainTranslator]: Completed translation [2024-11-11 12:45:20,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20 WrapperNode [2024-11-11 12:45:20,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:20,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:20,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 12:45:20,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 12:45:20,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,819 INFO L138 Inliner]: procedures = 274, calls = 1654, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1813 [2024-11-11 12:45:20,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:20,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 12:45:20,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 12:45:20,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 12:45:20,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,918 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 12:45:20,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 12:45:20,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 12:45:20,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 12:45:20,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (1/1) ... [2024-11-11 12:45:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:45:20,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:21,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-11 12:45:21,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-11 12:45:21,126 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 12:45:21,129 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 12:45:21,129 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 12:45:21,129 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 12:45:21,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 12:45:21,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 12:45:21,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 12:45:21,133 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 12:45:21,309 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 12:45:21,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 12:45:23,295 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 12:45:23,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 12:45:54,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 12:45:54,587 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 12:45:54,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:54 BoogieIcfgContainer [2024-11-11 12:45:54,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 12:45:54,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 12:45:54,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 12:45:54,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 12:45:54,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 12:45:19" (1/3) ... [2024-11-11 12:45:54,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70866c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:54, skipping insertion in model container [2024-11-11 12:45:54,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:20" (2/3) ... [2024-11-11 12:45:54,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70866c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:54, skipping insertion in model container [2024-11-11 12:45:54,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:54" (3/3) ... [2024-11-11 12:45:54,599 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2024-11-11 12:45:54,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 12:45:54,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-11 12:45:54,619 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 12:45:54,733 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 12:45:54,790 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:54,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 12:45:54,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:54,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-11 12:45:54,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-11 12:45:54,830 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 12:45:54,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 12:45:54,850 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3be8f93c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:54,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-11 12:45:55,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:45:55,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2091221199, now seen corresponding path program 1 times [2024-11-11 12:45:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492972906] [2024-11-11 12:45:55,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:55,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492972906] [2024-11-11 12:45:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492972906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410984422] [2024-11-11 12:45:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:56,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 12:45:56,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 12:45:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 12:45:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:56,648 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:56,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) [2024-11-11 12:45:56,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:57,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:57,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 12:45:57,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:45:57,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 16546664, now seen corresponding path program 1 times [2024-11-11 12:45:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837362601] [2024-11-11 12:45:57,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837362601] [2024-11-11 12:45:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837362601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:59,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:59,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:45:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798079199] [2024-11-11 12:45:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:59,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:59,747 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:59,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:45:59,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:59,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 12:46:00,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 512950408, now seen corresponding path program 1 times [2024-11-11 12:46:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111894076] [2024-11-11 12:46:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:02,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:02,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111894076] [2024-11-11 12:46:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111894076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:46:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943883503] [2024-11-11 12:46:02,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:02,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:46:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:46:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:46:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:02,791 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:02,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:02,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:02,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:02,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:04,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 12:46:04,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:04,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash -975774549, now seen corresponding path program 1 times [2024-11-11 12:46:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713516121] [2024-11-11 12:46:04,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:06,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713516121] [2024-11-11 12:46:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713516121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:06,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:46:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590659742] [2024-11-11 12:46:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:06,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:46:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:46:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 12:46:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:06,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:06,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:08,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 12:46:08,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:08,207 INFO L85 PathProgramCache]: Analyzing trace with hash -184236116, now seen corresponding path program 1 times [2024-11-11 12:46:08,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373708882] [2024-11-11 12:46:08,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:08,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373708882] [2024-11-11 12:46:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373708882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:46:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909589380] [2024-11-11 12:46:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:10,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:46:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:46:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 12:46:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:10,055 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:10,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:10,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:10,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:10,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:10,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:10,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 12:46:10,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:10,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -957125808, now seen corresponding path program 1 times [2024-11-11 12:46:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:10,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077967641] [2024-11-11 12:46:10,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077967641] [2024-11-11 12:46:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077967641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:46:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761698491] [2024-11-11 12:46:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:11,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:46:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:46:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:46:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:11,224 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:11,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:11,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 12:46:12,434 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:12,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash 556739631, now seen corresponding path program 1 times [2024-11-11 12:46:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485822537] [2024-11-11 12:46:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485822537] [2024-11-11 12:46:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485822537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883414779] [2024-11-11 12:46:14,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:14,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:14,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:14,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:14,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 12:46:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:14,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 3412 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-11 12:46:14,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:14,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-11-11 12:46:15,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:15,134 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-11 12:46:15,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-11 12:46:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:15,208 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2024-11-11 12:46:15,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:15,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 12:46:15,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:15,311 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 18 treesize of output 13 [2024-11-11 12:46:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-11 12:46:15,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:15,351 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 36 treesize of output 20 [2024-11-11 12:46:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:15,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:17,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_118 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_7| 2147483648) 0) (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_118) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 3208 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2024-11-11 12:46:17,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_115 Int) (v_ArrVal_118 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_7| 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_115) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_118) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 3208 |c_~#queue~0.offset|)))) (< v_ArrVal_115 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) is different from false [2024-11-11 12:46:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-11 12:46:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883414779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:21,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2024-11-11 12:46:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347246049] [2024-11-11 12:46:21,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 12:46:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 12:46:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=218, Unknown=7, NotChecked=66, Total=380 [2024-11-11 12:46:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:21,875 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:21,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:21,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:21,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:21,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:21,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:21,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:21,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:21,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:23,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 12:46:23,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 12:46:23,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 79063201, now seen corresponding path program 1 times [2024-11-11 12:46:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:23,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883957711] [2024-11-11 12:46:23,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883957711] [2024-11-11 12:46:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883957711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507920653] [2024-11-11 12:46:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:27,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 12:46:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:27,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 3413 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-11 12:46:27,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:27,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-11-11 12:46:28,114 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:28,138 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-11 12:46:28,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-11 12:46:28,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:28,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:28,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 27 [2024-11-11 12:46:28,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:28,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-11-11 12:46:28,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:28,372 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 27 treesize of output 20 [2024-11-11 12:46:28,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-11-11 12:46:28,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:28,429 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 43 treesize of output 23 [2024-11-11 12:46:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:28,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:28,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2024-11-11 12:46:28,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 3208 |c_~#queue~0.offset|)) 2147483647)) is different from false [2024-11-11 12:46:28,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_163 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))) is different from false [2024-11-11 12:46:28,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_160) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_160) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))) is different from false [2024-11-11 12:46:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-11 12:46:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507920653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:28,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:28,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2024-11-11 12:46:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093394004] [2024-11-11 12:46:28,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:28,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 12:46:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 12:46:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=225, Unknown=4, NotChecked=140, Total=462 [2024-11-11 12:46:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:28,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:28,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:28,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:30,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_160 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|) (< (+ (select .cse0 .cse2) 1) v_ArrVal_160) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_160) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| Int) (v_ArrVal_163 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26| 1))) |c_~#stored_elements~0.base| v_ArrVal_163) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) .cse2) 2147483647) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_26|)))))) is different from false [2024-11-11 12:46:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 12:46:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:30,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 12:46:30,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:30,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1329552764, now seen corresponding path program 1 times [2024-11-11 12:46:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927094683] [2024-11-11 12:46:30,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927094683] [2024-11-11 12:46:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927094683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101708843] [2024-11-11 12:46:33,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:33,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:33,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:33,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 12:46:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:34,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 3425 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-11 12:46:34,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:34,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2024-11-11 12:46:34,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:34,268 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 30 treesize of output 23 [2024-11-11 12:46:34,316 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-11 12:46:34,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2024-11-11 12:46:34,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-11 12:46:34,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-11 12:46:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:34,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:34,430 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int)) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_206) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1)) 2147483650))) is different from false [2024-11-11 12:46:34,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_206) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) .cse1))))) is different from false [2024-11-11 12:46:34,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2024-11-11 12:46:34,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,523 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 74 treesize of output 74 [2024-11-11 12:46:34,529 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 36 treesize of output 24 [2024-11-11 12:46:34,542 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 17 treesize of output 9 [2024-11-11 12:46:34,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,566 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 59 treesize of output 47 [2024-11-11 12:46:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101708843] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:34,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 24 [2024-11-11 12:46:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158864294] [2024-11-11 12:46:34,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:34,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 12:46:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 12:46:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=455, Unknown=2, NotChecked=90, Total=650 [2024-11-11 12:46:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:34,671 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:34,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 25 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) [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:34,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-11 12:46:34,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-11 12:46:34,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:37,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 12:46:37,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:37,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:37,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash -514184489, now seen corresponding path program 1 times [2024-11-11 12:46:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:37,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668642535] [2024-11-11 12:46:37,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:37,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668642535] [2024-11-11 12:46:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668642535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695789455] [2024-11-11 12:46:37,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:37,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:37,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:37,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:37,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 12:46:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:38,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 3441 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 12:46:38,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:38,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 12:46:38,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695789455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:38,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 12:46:38,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-11 12:46:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957971159] [2024-11-11 12:46:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:38,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 12:46:38,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 12:46:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 12:46:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:38,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:38,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:38,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:39,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 12:46:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-11 12:46:39,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1240153860, now seen corresponding path program 1 times [2024-11-11 12:46:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198223730] [2024-11-11 12:46:39,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 12:46:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:39,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198223730] [2024-11-11 12:46:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198223730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:46:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:46:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:46:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875497887] [2024-11-11 12:46:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:46:39,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:46:39,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:46:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:46:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:39,570 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:39,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:39,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:40,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 12:46:40,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:40,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1234778228, now seen corresponding path program 1 times [2024-11-11 12:46:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624018224] [2024-11-11 12:46:40,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624018224] [2024-11-11 12:46:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624018224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136405488] [2024-11-11 12:46:44,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:44,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:44,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:44,062 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:44,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 12:46:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:44,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 3482 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-11 12:46:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:44,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2024-11-11 12:46:44,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:44,625 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-11 12:46:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-11 12:46:44,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:44,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:44,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:44,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 12:46:44,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-11-11 12:46:44,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:44,762 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 18 treesize of output 13 [2024-11-11 12:46:44,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:44,799 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-11 12:46:44,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-11 12:46:44,839 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 29 treesize of output 13 [2024-11-11 12:46:44,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-11 12:46:44,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:44,943 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 18 treesize of output 13 [2024-11-11 12:46:44,975 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-11 12:46:44,975 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 1 case distinctions, treesize of input 45 treesize of output 35 [2024-11-11 12:46:44,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 12:46:45,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-11 12:46:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:45,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:45,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1)) 2147483647)) is different from false [2024-11-11 12:46:45,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int)) (v_ArrVal_348 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_348) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse2)) 2147483647))))) is different from false [2024-11-11 12:46:45,523 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_342 Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_348 Int) (v_ArrVal_345 (Array Int Int))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_342) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_348) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|))))))))) is different from false [2024-11-11 12:46:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-11 12:46:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136405488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:46,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:46,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 13] total 34 [2024-11-11 12:46:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594712171] [2024-11-11 12:46:46,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:46,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-11 12:46:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:46,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-11 12:46:46,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=739, Unknown=38, NotChecked=192, Total=1260 [2024-11-11 12:46:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:46,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:46,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.857142857142857) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:46,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-11 12:46:46,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-11 12:46:46,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:46,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:46,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:48,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse8 .cse9))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_348 Int) (v_ArrVal_345 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (let ((.cse1 (select .cse5 .cse3))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (= .cse1 800) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_348) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647)))))) .cse10) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int) (v_ArrVal_348 Int) (v_ArrVal_345 (Array Int Int))) (let ((.cse13 (let ((.cse14 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (let ((.cse11 (select .cse13 .cse3))) (or (= 800 .cse11) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse6 v_ArrVal_348) .cse3 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int))) (< (select (let ((.cse15 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_342 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_350 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| Int) (v_ArrVal_348 Int) (v_ArrVal_345 (Array Int Int))) (let ((.cse20 (let ((.cse22 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)))) (let ((.cse19 (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse6 v_ArrVal_342) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44| 1))) |c_~#stored_elements~0.base| v_ArrVal_345) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (let ((.cse16 (select .cse20 .cse3)) (.cse17 (select .cse19 .cse3))) (or (= 800 .cse16) (< .cse16 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_44|) (= .cse17 800) (< (select (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse6 v_ArrVal_348) .cse3 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647)))))) (or .cse10 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int))) (< (select (let ((.cse23 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse3) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-11-11 12:46:48,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1)) 2147483647))) (< .cse4 2147483647)))) is different from false [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:46:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 12:46:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 12:46:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:46:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 12:46:48,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 12:46:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 12:46:48,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:46:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash 399573121, now seen corresponding path program 2 times [2024-11-11 12:46:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057889608] [2024-11-11 12:46:48,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057889608] [2024-11-11 12:46:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057889608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195637691] [2024-11-11 12:46:53,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 12:46:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:53,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:53,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 12:46:54,286 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 12:46:54,286 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 12:46:54,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 3525 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-11 12:46:54,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:54,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-11 12:46:54,430 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:54,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:54,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-11 12:46:54,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-11 12:46:54,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:54,611 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 23 treesize of output 16 [2024-11-11 12:46:54,661 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:54,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:54,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:54,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-11 12:46:54,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:54,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-11 12:46:54,891 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-11 12:46:54,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-11 12:46:54,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:55,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-11 12:46:55,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:55,094 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 23 treesize of output 16 [2024-11-11 12:46:55,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2024-11-11 12:46:55,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2024-11-11 12:46:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:55,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:47:00,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse9 (+ .cse0 1))))) (let ((.cse1 (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select .cse1 .cse4))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_432) (< (+ (select .cse1 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_437) .cse4 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= .cse6 800))))))))) is different from false [2024-11-11 12:47:02,403 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (select .cse6 .cse1))) (let ((.cse2 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_432) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_437) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647) (= .cse4 800) (= 800 .cse5) (< (+ (select .cse2 .cse3) 1) v_ArrVal_437) (< (+ (select .cse6 .cse3) 1) v_ArrVal_432)))))))) is different from false [2024-11-11 12:47:02,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse6 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse4 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (select .cse4 .cse6))) (let ((.cse1 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_432) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse6)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse3 (select .cse1 .cse6))) (or (= 800 .cse0) (< (+ (select .cse1 .cse2) 1) v_ArrVal_437) (= 800 .cse3) (< (+ (select .cse4 .cse2) 1) v_ArrVal_432) (< (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_437) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse6) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647)))))))) is different from false [2024-11-11 12:47:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 8 times theorem prover too weak. 0 trivial. 12 not checked. [2024-11-11 12:47:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195637691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:47:07,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:47:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 46 [2024-11-11 12:47:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012271617] [2024-11-11 12:47:07,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:47:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-11 12:47:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:47:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-11 12:47:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1460, Unknown=75, NotChecked=264, Total=2256 [2024-11-11 12:47:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:07,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:47:07,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5106382978723403) internal successors, (118), 47 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 12:47:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:47:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-11 12:47:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:14,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|)) (.cse24 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse41 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse42 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse41 .cse42 (+ (select .cse41 .cse42) 1))))) (.cse22 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int)) (let ((.cse1 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (let ((.cse0 (select .cse1 .cse4))) (or (= .cse0 800) (< (+ (select .cse1 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_437) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_25|) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_426 Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse8 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_31|))) (let ((.cse11 (select .cse8 .cse4))) (let ((.cse13 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_426) .cse4 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse10 (select .cse13 .cse4))) (let ((.cse7 (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_432) .cse4 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse4))) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse9 (select .cse7 .cse4))) (or (< (+ (select .cse7 .cse2) 1) v_ArrVal_437) (< (+ (select .cse8 .cse2) 1) v_ArrVal_426) (= 800 .cse9) (= .cse10 800) (= 800 .cse11) (< (select (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_437) .cse4 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (< (+ (select .cse13 .cse2) 1) v_ArrVal_432))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse20 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_29|))) (let ((.cse16 (select .cse20 .cse4))) (let ((.cse19 (let ((.cse21 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse20 .cse2 v_ArrVal_432) .cse4 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse17 (select .cse19 .cse4))) (or (= .cse16 800) (= 800 .cse17) (< (select (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse19 .cse2 v_ArrVal_437) .cse4 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (< (+ (select .cse20 .cse2) 1) v_ArrVal_432) (< (+ (select .cse19 .cse2) 1) v_ArrVal_437))))))) (or .cse22 (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse23 (select (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647))) (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse25 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647)) (or .cse22 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse30 (let ((.cse32 (select (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse32 (+ (* (select .cse32 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse26 (select .cse30 .cse4))) (let ((.cse27 (let ((.cse31 (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse30 .cse2 v_ArrVal_432) .cse4 (+ .cse26 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* (select .cse31 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse29 (select .cse27 .cse4))) (or (= .cse26 800) (< (+ (select .cse27 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse28 (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse27 .cse2 v_ArrVal_437) .cse4 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (< (+ (select .cse30 .cse2) 1) v_ArrVal_432) (= .cse29 800)))))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse34 (let ((.cse36 (select (store .cse24 |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse36 (+ (* (select .cse36 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse35 (select .cse34 .cse4))) (or (< (select (let ((.cse33 (select (store (store .cse24 |c_~#queue~0.base| (store (store .cse34 .cse2 v_ArrVal_437) .cse4 (+ .cse35 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse33 (+ (* (select .cse33 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= 800 .cse35) (< (+ (select .cse34 .cse2) 1) v_ArrVal_437))))) .cse22) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse37 (let ((.cse40 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse40 (+ (* 4 (select .cse40 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse39 (select .cse37 .cse4))) (or (< (+ (select .cse37 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse38 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse37 .cse2 v_ArrVal_437) .cse4 (+ .cse39 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse38 (+ (* (select .cse38 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= 800 .cse39)))))))) is different from false [2024-11-11 12:47:14,048 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_350 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_350) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse1)) 2147483647)) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646)) is different from false [2024-11-11 12:47:14,055 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse5 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse4 (select .cse5 .cse1))) (or (= .cse4 800) (< (+ (select .cse5 .cse3) 1) v_ArrVal_437) (< (select (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_437) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse11 (let ((.cse14 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse8 (select .cse11 .cse1))) (let ((.cse9 (let ((.cse13 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_432) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse10 (select .cse9 .cse1))) (or (= 800 .cse8) (< (+ (select .cse9 .cse3) 1) v_ArrVal_437) (= 800 .cse10) (< (+ (select .cse11 .cse3) 1) v_ArrVal_432) (< (select (let ((.cse12 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse9 .cse3 v_ArrVal_437) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647))))))))) is different from false [2024-11-11 12:47:14,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_429 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse7 (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_429) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)))) (let ((.cse6 (select .cse7 .cse1))) (let ((.cse4 (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_432) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_437) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= .cse5 800) (= 800 .cse6) (< (+ (select .cse4 .cse2) 1) v_ArrVal_437) (< (+ (select .cse7 .cse2) 1) v_ArrVal_432))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse10 (let ((.cse13 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse13 (+ (* 4 (select .cse13 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse12 (select .cse10 .cse1))) (or (< (+ (select .cse10 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse2 v_ArrVal_437) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= 800 .cse12))))))) is different from false [2024-11-11 12:47:22,772 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] [2024-11-11 12:47:24,791 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] [2024-11-11 12:47:25,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:47:28,333 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] [2024-11-11 12:47:30,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:47:32,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:47:34,412 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] [2024-11-11 12:47:36,509 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] [2024-11-11 12:47:36,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse14 (select .cse9 .cse11))) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse12 (+ .cse14 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (= 800 .cse14))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_432 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_432) .cse11 .cse12)))) (let ((.cse2 (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse7 (select .cse2 .cse5))) (or (< .cse1 v_ArrVal_432) (< (+ (select .cse2 .cse3) 1) v_ArrVal_437) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_437) .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647) (= .cse7 800))))))) (or (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int)) (or (< .cse1 v_ArrVal_437) (< (select (let ((.cse13 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_437) .cse11 .cse12)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse3) 2147483647))) .cse0) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646))))) is different from false [2024-11-11 12:47:36,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))))) (.cse0 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800))) (and (or .cse0 (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse1 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse4) 2147483647))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse6 (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse7 (select .cse6 .cse2))) (or (< (select (let ((.cse5 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_437) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse4) 2147483647) (= 800 .cse7) (< (+ (select .cse6 .cse4) 1) v_ArrVal_437))))) .cse0))) is different from false [2024-11-11 12:47:42,803 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] [2024-11-11 12:47:43,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int) (v_ArrVal_434 (Array Int Int))) (let ((.cse3 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_434) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)))) (let ((.cse5 (select .cse3 .cse1))) (or (< (+ (select .cse3 .cse2) 1) v_ArrVal_437) (< (select (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_437) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) .cse2) 2147483647) (= 800 .cse5))))))) is different from false [2024-11-11 12:47:58,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:00,338 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] [2024-11-11 12:48:02,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:04,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:05,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:07,720 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] [2024-11-11 12:48:09,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:11,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:13,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:15,512 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] [2024-11-11 12:48:17,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:48:19,965 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] [2024-11-11 12:48:21,988 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] [2024-11-11 12:48:21,996 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse1 .cse2))) (or (forall ((v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_437 Int)) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_437) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_437) .cse2 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)) (+ 3208 |c_~#queue~0.offset|)) 2147483647))) (= 800 .cse3)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2024-11-11 12:48:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:48:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:48:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:48:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:48:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-11 12:48:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:48:22,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 12:48:22,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 12:48:22,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-11-11 12:48:22,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:48:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash -499077837, now seen corresponding path program 2 times [2024-11-11 12:48:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:48:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925535968] [2024-11-11 12:48:22,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:48:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:48:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat