./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext-properties/test-0513_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:17:53,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:17:53,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:17:53,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:17:53,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:17:53,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:17:53,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:17:53,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:17:53,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:17:53,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:17:53,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:17:53,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:17:53,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:17:53,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:17:53,579 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:17:53,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:17:53,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:17:53,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:17:53,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:17:53,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:17:53,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:17:53,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:17:53,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:17:53,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:17:53,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:17:53,583 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:17:53,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:17:53,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:17:53,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:17:53,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:17:53,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:17:53,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:17:53,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:17:53,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:17:53,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:17:53,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:17:53,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:17:53,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:17:53,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:17:53,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:17:53,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:17:53,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:17:53,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:17:53,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:17:53,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 -> Automizer 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2024-11-19 10:17:53,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:17:53,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:17:53,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:17:53,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:17:53,801 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:17:53,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-11-19 10:17:54,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:17:55,165 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:17:55,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-11-19 10:17:55,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1de6bd83/3534241e7a524aeea97d20d94afb93bf/FLAG73fecad7f [2024-11-19 10:17:55,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1de6bd83/3534241e7a524aeea97d20d94afb93bf [2024-11-19 10:17:55,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:17:55,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:17:55,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:17:55,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:17:55,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:17:55,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296d7db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55, skipping insertion in model container [2024-11-19 10:17:55,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:17:55,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:17:55,507 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:17:55,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:17:55,598 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:17:55,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55 WrapperNode [2024-11-19 10:17:55,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:17:55,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:17:55,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:17:55,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:17:55,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,638 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2024-11-19 10:17:55,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:17:55,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:17:55,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:17:55,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:17:55,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,662 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2024-11-19 10:17:55,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:17:55,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:17:55,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:17:55,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:17:55,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (1/1) ... [2024-11-19 10:17:55,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:17:55,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:17:55,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:17:55,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:17:55,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:17:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:17:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:17:55,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:17:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:17:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:17:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:17:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:17:55,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:17:55,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:17:55,882 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:17:55,884 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:17:56,118 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-19 10:17:56,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:17:56,127 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:17:56,127 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 10:17:56,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:56 BoogieIcfgContainer [2024-11-19 10:17:56,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:17:56,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:17:56,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:17:56,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:17:56,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:17:55" (1/3) ... [2024-11-19 10:17:56,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e355e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:56, skipping insertion in model container [2024-11-19 10:17:56,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:17:55" (2/3) ... [2024-11-19 10:17:56,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e355e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:17:56, skipping insertion in model container [2024-11-19 10:17:56,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:56" (3/3) ... [2024-11-19 10:17:56,134 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2024-11-19 10:17:56,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:17:56,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-19 10:17:56,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:17:56,196 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=PETRI_NET, 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;@273eb95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:17:56,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 10:17:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 45 states have internal predecessors, (65), 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-19 10:17:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 10:17:56,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:56,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 10:17:56,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 889569447, now seen corresponding path program 1 times [2024-11-19 10:17:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118814102] [2024-11-19 10:17:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:56,387 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-19 10:17:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118814102] [2024-11-19 10:17:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118814102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483948335] [2024-11-19 10:17:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:56,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:56,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:56,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:56,410 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 45 states have internal predecessors, (65), 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) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-19 10:17:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:56,464 INFO L93 Difference]: Finished difference Result 110 states and 165 transitions. [2024-11-19 10:17:56,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:56,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) Word has length 6 [2024-11-19 10:17:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:56,488 INFO L225 Difference]: With dead ends: 110 [2024-11-19 10:17:56,489 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 10:17:56,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:56,494 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:56,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 144 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 10:17:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 10:17:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 33 states have internal predecessors, (40), 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-19 10:17:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-19 10:17:56,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 6 [2024-11-19 10:17:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:56,518 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-19 10:17:56,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-19 10:17:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-19 10:17:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 10:17:56,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:56,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:56,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:17:56,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:56,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash 669083281, now seen corresponding path program 1 times [2024-11-19 10:17:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969066374] [2024-11-19 10:17:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:56,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:56,656 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-19 10:17:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969066374] [2024-11-19 10:17:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969066374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:56,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:17:56,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010982991] [2024-11-19 10:17:56,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:56,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:17:56,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:56,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:17:56,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:17:56,659 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-19 10:17:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:56,755 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-19 10:17:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:17:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) Word has length 12 [2024-11-19 10:17:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:56,757 INFO L225 Difference]: With dead ends: 54 [2024-11-19 10:17:56,757 INFO L226 Difference]: Without dead ends: 51 [2024-11-19 10:17:56,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:17:56,759 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:56,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 53 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:17:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-19 10:17:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2024-11-19 10:17:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 43 states have internal predecessors, (55), 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-19 10:17:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-11-19 10:17:56,767 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 12 [2024-11-19 10:17:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:56,767 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-11-19 10:17:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-19 10:17:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-11-19 10:17:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:17:56,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:56,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:56,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:17:56,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:56,771 INFO L85 PathProgramCache]: Analyzing trace with hash -733254697, now seen corresponding path program 1 times [2024-11-19 10:17:56,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:56,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086062126] [2024-11-19 10:17:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:56,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:56,833 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-19 10:17:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086062126] [2024-11-19 10:17:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086062126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:56,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:17:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288649694] [2024-11-19 10:17:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:17:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:17:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:56,836 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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-19 10:17:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:56,883 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-11-19 10:17:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:17:56,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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) Word has length 13 [2024-11-19 10:17:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:56,885 INFO L225 Difference]: With dead ends: 92 [2024-11-19 10:17:56,885 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 10:17:56,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:56,886 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 10:17:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-11-19 10:17:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 51 states have internal predecessors, (59), 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-19 10:17:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-19 10:17:56,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 13 [2024-11-19 10:17:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:56,897 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-19 10:17:56,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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-19 10:17:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-19 10:17:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 10:17:56,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:56,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:56,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:17:56,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:56,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -733195115, now seen corresponding path program 1 times [2024-11-19 10:17:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405835464] [2024-11-19 10:17:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:56,984 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-19 10:17:56,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:56,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405835464] [2024-11-19 10:17:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405835464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:56,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:56,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:17:56,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692411834] [2024-11-19 10:17:56,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:17:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:17:56,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:17:56,988 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 10:17:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,045 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-19 10:17:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:17:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) Word has length 13 [2024-11-19 10:17:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,046 INFO L225 Difference]: With dead ends: 93 [2024-11-19 10:17:57,046 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 10:17:57,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:17:57,048 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 52 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:17:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 10:17:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-11-19 10:17:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 51 states have internal predecessors, (58), 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-19 10:17:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-19 10:17:57,058 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 13 [2024-11-19 10:17:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-19 10:17:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 10:17:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-19 10:17:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 10:17:57,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:17:57,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1153767066, now seen corresponding path program 1 times [2024-11-19 10:17:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366979761] [2024-11-19 10:17:57,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366979761] [2024-11-19 10:17:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366979761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149453163] [2024-11-19 10:17:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:57,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:57,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:57,143 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,179 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-19 10:17:57,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 10:17:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,180 INFO L225 Difference]: With dead ends: 52 [2024-11-19 10:17:57,180 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 10:17:57,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:57,181 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 10:17:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-11-19 10:17:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 40 states have internal predecessors, (47), 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-19 10:17:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-19 10:17:57,184 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 25 [2024-11-19 10:17:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,184 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-19 10:17:57,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-19 10:17:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:17:57,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:17:57,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1407040626, now seen corresponding path program 1 times [2024-11-19 10:17:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488221024] [2024-11-19 10:17:57,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:57,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488221024] [2024-11-19 10:17:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488221024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:57,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888389437] [2024-11-19 10:17:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:57,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:57,259 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-19 10:17:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,298 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-19 10:17:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:57,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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) Word has length 26 [2024-11-19 10:17:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,299 INFO L225 Difference]: With dead ends: 50 [2024-11-19 10:17:57,299 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 10:17:57,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:57,300 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 10:17:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 10:17:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 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-19 10:17:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-19 10:17:57,303 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 26 [2024-11-19 10:17:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,304 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-19 10:17:57,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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-19 10:17:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-19 10:17:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:17:57,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:17:57,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2005227786, now seen corresponding path program 1 times [2024-11-19 10:17:57,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240207515] [2024-11-19 10:17:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 10:17:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240207515] [2024-11-19 10:17:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240207515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:57,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:17:57,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12424016] [2024-11-19 10:17:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:17:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:17:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:57,361 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,385 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2024-11-19 10:17:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:17:57,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 10:17:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,386 INFO L225 Difference]: With dead ends: 98 [2024-11-19 10:17:57,386 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 10:17:57,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:57,387 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 10:17:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-11-19 10:17:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 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-19 10:17:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-19 10:17:57,391 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 32 [2024-11-19 10:17:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,391 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-19 10:17:57,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-19 10:17:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 10:17:57,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:17:57,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2032332458, now seen corresponding path program 1 times [2024-11-19 10:17:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455178827] [2024-11-19 10:17:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:17:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455178827] [2024-11-19 10:17:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455178827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:17:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150430059] [2024-11-19 10:17:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:17:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:57,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:17:57,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:57,482 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-19 10:17:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,506 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-19 10:17:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:17:57,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 33 [2024-11-19 10:17:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,507 INFO L225 Difference]: With dead ends: 59 [2024-11-19 10:17:57,507 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 10:17:57,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:17:57,508 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 10:17:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-11-19 10:17:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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-19 10:17:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-19 10:17:57,514 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 33 [2024-11-19 10:17:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,514 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-19 10:17:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-19 10:17:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-19 10:17:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 10:17:57,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:17:57,517 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1831843089, now seen corresponding path program 1 times [2024-11-19 10:17:57,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389327269] [2024-11-19 10:17:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389327269] [2024-11-19 10:17:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389327269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:17:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431670457] [2024-11-19 10:17:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:17:57,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:17:57,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:17:57,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:17:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:57,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 10:17:57,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:17:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 10:17:57,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:17:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431670457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:17:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 10:17:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429051655] [2024-11-19 10:17:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:57,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:57,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:57,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:17:57,748 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-19 10:17:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:57,774 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2024-11-19 10:17:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:17:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) Word has length 39 [2024-11-19 10:17:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:57,775 INFO L225 Difference]: With dead ends: 98 [2024-11-19 10:17:57,775 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 10:17:57,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:17:57,776 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 10:17:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-19 10:17:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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-19 10:17:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2024-11-19 10:17:57,779 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 39 [2024-11-19 10:17:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:57,779 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2024-11-19 10:17:57,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-19 10:17:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2024-11-19 10:17:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 10:17:57,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:57,780 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:57,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 10:17:57,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:17:57,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:57,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1352822027, now seen corresponding path program 1 times [2024-11-19 10:17:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:57,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057115145] [2024-11-19 10:17:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057115145] [2024-11-19 10:17:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057115145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:17:58,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417124764] [2024-11-19 10:17:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:58,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:17:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:17:58,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 10:17:58,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 10:17:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:58,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 10:17:58,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:17:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:58,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:17:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:17:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417124764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:17:58,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:17:58,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 11 [2024-11-19 10:17:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096808602] [2024-11-19 10:17:58,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:17:58,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 10:17:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 10:17:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-19 10:17:58,347 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:58,578 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2024-11-19 10:17:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 10:17:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-19 10:17:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:58,580 INFO L225 Difference]: With dead ends: 186 [2024-11-19 10:17:58,581 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 10:17:58,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-19 10:17:58,582 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:58,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 69 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:17:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 10:17:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2024-11-19 10:17:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.1031746031746033) internal successors, (139), 126 states have internal predecessors, (139), 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-19 10:17:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2024-11-19 10:17:58,588 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 43 [2024-11-19 10:17:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:58,588 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2024-11-19 10:17:58,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2024-11-19 10:17:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 10:17:58,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:58,589 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:17:58,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 10:17:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 10:17:58,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:58,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:58,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1278593746, now seen corresponding path program 1 times [2024-11-19 10:17:58,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:58,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866123335] [2024-11-19 10:17:58,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:58,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-19 10:17:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866123335] [2024-11-19 10:17:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866123335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706689422] [2024-11-19 10:17:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:58,902 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-19 10:17:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:58,929 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-19 10:17:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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) Word has length 64 [2024-11-19 10:17:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:58,930 INFO L225 Difference]: With dead ends: 154 [2024-11-19 10:17:58,930 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 10:17:58,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:58,931 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:58,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 10:17:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-19 10:17:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 152 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:17:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2024-11-19 10:17:58,941 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 64 [2024-11-19 10:17:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:58,942 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2024-11-19 10:17:58,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-19 10:17:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2024-11-19 10:17:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 10:17:58,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:17:58,943 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:58,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 10:17:58,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-19 10:17:58,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:17:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1931180265, now seen corresponding path program 1 times [2024-11-19 10:17:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:17:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128101944] [2024-11-19 10:17:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:17:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:17:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:17:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-19 10:17:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:17:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128101944] [2024-11-19 10:17:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128101944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:17:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:17:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:17:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580935426] [2024-11-19 10:17:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:17:59,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:17:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:17:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:17:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:59,087 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-19 10:17:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:17:59,107 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2024-11-19 10:17:59,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:17:59,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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) Word has length 81 [2024-11-19 10:17:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:17:59,108 INFO L225 Difference]: With dead ends: 153 [2024-11-19 10:17:59,108 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 10:17:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:17:59,109 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:17:59,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:17:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 10:17:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 10:17:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-19 10:17:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 10:17:59,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2024-11-19 10:17:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:17:59,112 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 10:17:59,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-19 10:17:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 10:17:59,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 10:17:59,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-19 10:17:59,115 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-19 10:17:59,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-19 10:17:59,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 10:17:59,119 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:17:59,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 10:17:59,186 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:17:59,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:17:59 BoogieIcfgContainer [2024-11-19 10:17:59,201 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:17:59,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:17:59,202 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:17:59,202 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:17:59,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:17:56" (3/4) ... [2024-11-19 10:17:59,204 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 10:17:59,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-19 10:17:59,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 10:17:59,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 10:17:59,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 10:17:59,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:17:59,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 10:17:59,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:17:59,288 INFO L158 Benchmark]: Toolchain (without parser) took 4097.39ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 102.2MB in the beginning and 106.1MB in the end (delta: -3.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,288 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:17:59,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.50ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 82.1MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.89ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 79.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,289 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 77.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,290 INFO L158 Benchmark]: RCFGBuilder took 452.18ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 76.6MB in the beginning and 189.3MB in the end (delta: -112.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,290 INFO L158 Benchmark]: TraceAbstraction took 3071.46ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 112.4MB in the end (delta: 76.9MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,290 INFO L158 Benchmark]: Witness Printer took 86.30ms. Allocated memory is still 230.7MB. Free memory was 111.3MB in the beginning and 106.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:17:59,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.50ms. Allocated memory is still 159.4MB. Free memory was 101.8MB in the beginning and 82.1MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.89ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 79.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 77.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 452.18ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 76.6MB in the beginning and 189.3MB in the end (delta: -112.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3071.46ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 112.4MB in the end (delta: 76.9MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * Witness Printer took 86.30ms. Allocated memory is still 230.7MB. Free memory was 111.3MB in the beginning and 106.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 538]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 546]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 546]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 548]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 609 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 356 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 651 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 253 mSDtfsCounter, 651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=11, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 497 ConstructedInterpolants, 0 QuantifiedInterpolants, 898 SizeOfPredicates, 1 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 339/359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 537]: Loop Invariant Derived loop invariant: (0 < ((long long) 1073741825 + c1)) - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-11-19 10:17:59,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE