./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound2.c -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 7950877d732f4800002d6a797590b13f630fa3c613f928d7858c74ba3c97d345 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:56:06,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:56:07,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 20:56:07,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:56:07,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:56:07,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:56:07,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:56:07,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:56:07,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:56:07,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:56:07,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:56:07,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:56:07,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:56:07,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:56:07,104 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:56:07,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:56:07,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:56:07,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 20:56:07,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:56:07,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 20:56:07,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:56:07,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:56:07,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:56:07,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:56:07,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:56:07,109 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:56:07,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:56:07,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 20:56:07,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:56:07,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:56:07,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:56:07,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:56:07,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:56:07,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:56:07,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:07,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:56:07,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:56:07,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:56:07,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:56:07,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:56:07,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:56:07,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:56:07,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:56:07,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:56:07,114 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 -> 7950877d732f4800002d6a797590b13f630fa3c613f928d7858c74ba3c97d345 [2024-10-14 20:56:07,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:56:07,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:56:07,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:56:07,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:56:07,394 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:56:07,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound2.c [2024-10-14 20:56:08,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:56:09,043 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:56:09,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound2.c [2024-10-14 20:56:09,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdf92627/66877414e2c04aa2a26b23928ddffb33/FLAG881e713f8 [2024-10-14 20:56:09,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdf92627/66877414e2c04aa2a26b23928ddffb33 [2024-10-14 20:56:09,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:56:09,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:56:09,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:09,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:56:09,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:56:09,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9eb9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09, skipping insertion in model container [2024-10-14 20:56:09,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:56:09,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:09,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:56:09,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:56:09,345 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:56:09,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09 WrapperNode [2024-10-14 20:56:09,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:56:09,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:09,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:56:09,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:56:09,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,374 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-10-14 20:56:09,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:56:09,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:56:09,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:56:09,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:56:09,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,401 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-10-14 20:56:09,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:56:09,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:56:09,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:56:09,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:56:09,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (1/1) ... [2024-10-14 20:56:09,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:56:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:09,453 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-10-14 20:56:09,455 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-10-14 20:56:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 20:56:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 20:56:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 20:56:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 20:56:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 20:56:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:56:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:56:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 20:56:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 20:56:09,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:56:09,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:56:09,754 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 20:56:09,754 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:56:09,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:56:09,786 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 20:56:09,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:09 BoogieIcfgContainer [2024-10-14 20:56:09,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:56:09,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:56:09,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:56:09,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:56:09,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:56:09" (1/3) ... [2024-10-14 20:56:09,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b23a188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:09, skipping insertion in model container [2024-10-14 20:56:09,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:56:09" (2/3) ... [2024-10-14 20:56:09,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b23a188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:56:09, skipping insertion in model container [2024-10-14 20:56:09,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:09" (3/3) ... [2024-10-14 20:56:09,800 INFO L112 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound2.c [2024-10-14 20:56:09,815 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:56:09,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 20:56:09,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:56:09,898 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;@55d261b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:56:09,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 20:56:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:56:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 20:56:09,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:09,916 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:09,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 529971304, now seen corresponding path program 1 times [2024-10-14 20:56:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498932341] [2024-10-14 20:56:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498932341] [2024-10-14 20:56:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498932341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:10,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:56:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539389816] [2024-10-14 20:56:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:10,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 20:56:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 20:56:10,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:56:10,162 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 20:56:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:10,188 INFO L93 Difference]: Finished difference Result 82 states and 124 transitions. [2024-10-14 20:56:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 20:56:10,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-14 20:56:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:10,196 INFO L225 Difference]: With dead ends: 82 [2024-10-14 20:56:10,196 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 20:56:10,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 20:56:10,202 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:10,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 20:56:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 20:56:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 20:56:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-10-14 20:56:10,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2024-10-14 20:56:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:10,241 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-10-14 20:56:10,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 20:56:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-10-14 20:56:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 20:56:10,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:10,243 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:10,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:56:10,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:10,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 689927656, now seen corresponding path program 1 times [2024-10-14 20:56:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:10,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983974437] [2024-10-14 20:56:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:10,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983974437] [2024-10-14 20:56:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983974437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:56:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129758357] [2024-10-14 20:56:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:56:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:56:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:56:10,509 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:56:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:10,553 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-14 20:56:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:10,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2024-10-14 20:56:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:10,558 INFO L225 Difference]: With dead ends: 44 [2024-10-14 20:56:10,558 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 20:56:10,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:56:10,559 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:10,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 20:56:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-14 20:56:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 20:56:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-10-14 20:56:10,570 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2024-10-14 20:56:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:10,572 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-10-14 20:56:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 20:56:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-10-14 20:56:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 20:56:10,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:10,573 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:10,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:56:10,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -254797239, now seen corresponding path program 1 times [2024-10-14 20:56:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481663072] [2024-10-14 20:56:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:10,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:10,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481663072] [2024-10-14 20:56:10,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481663072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:10,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:10,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 20:56:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466280903] [2024-10-14 20:56:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:56:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:56:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:56:10,764 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:56:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:10,993 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-10-14 20:56:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 20:56:10,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-10-14 20:56:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:11,000 INFO L225 Difference]: With dead ends: 61 [2024-10-14 20:56:11,000 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 20:56:11,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:11,001 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:11,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 20:56:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2024-10-14 20:56:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:56:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-10-14 20:56:11,015 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 34 [2024-10-14 20:56:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:11,016 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-10-14 20:56:11,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:56:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-10-14 20:56:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 20:56:11,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:11,017 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:11,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:56:11,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash 691220249, now seen corresponding path program 1 times [2024-10-14 20:56:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945441333] [2024-10-14 20:56:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:11,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945441333] [2024-10-14 20:56:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945441333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 20:56:11,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015994412] [2024-10-14 20:56:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 20:56:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:11,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 20:56:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:56:11,199 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:56:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:11,280 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2024-10-14 20:56:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 20:56:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-10-14 20:56:11,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:11,282 INFO L225 Difference]: With dead ends: 90 [2024-10-14 20:56:11,282 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 20:56:11,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:11,284 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:11,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 183 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 20:56:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 20:56:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:56:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-10-14 20:56:11,292 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 35 [2024-10-14 20:56:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:11,292 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-10-14 20:56:11,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 20:56:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-10-14 20:56:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 20:56:11,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:11,293 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:11,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:56:11,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:11,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1149535416, now seen corresponding path program 1 times [2024-10-14 20:56:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265137369] [2024-10-14 20:56:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:11,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265137369] [2024-10-14 20:56:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265137369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:11,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:11,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 20:56:11,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321274095] [2024-10-14 20:56:11,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:11,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:11,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:11,470 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:11,636 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-10-14 20:56:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 20:56:11,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-10-14 20:56:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:11,641 INFO L225 Difference]: With dead ends: 101 [2024-10-14 20:56:11,641 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 20:56:11,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:56:11,642 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 46 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:11,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 211 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:11,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 20:56:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-10-14 20:56:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 20:56:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2024-10-14 20:56:11,661 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 44 [2024-10-14 20:56:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2024-10-14 20:56:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2024-10-14 20:56:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:56:11,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:11,662 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:11,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:56:11,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:11,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1275859616, now seen corresponding path program 1 times [2024-10-14 20:56:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891345485] [2024-10-14 20:56:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891345485] [2024-10-14 20:56:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891345485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 20:56:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472901247] [2024-10-14 20:56:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:11,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:56:11,844 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:11,985 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-10-14 20:56:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:56:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-10-14 20:56:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:11,987 INFO L225 Difference]: With dead ends: 81 [2024-10-14 20:56:11,987 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 20:56:11,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:56:11,988 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 33 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:11,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 181 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 20:56:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-10-14 20:56:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 59 states have internal predecessors, (69), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2024-10-14 20:56:12,002 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 45 [2024-10-14 20:56:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:12,003 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2024-10-14 20:56:12,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2024-10-14 20:56:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 20:56:12,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:12,005 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:12,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:56:12,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:12,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1275897352, now seen corresponding path program 1 times [2024-10-14 20:56:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:12,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450699770] [2024-10-14 20:56:12,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:12,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450699770] [2024-10-14 20:56:12,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450699770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:12,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962276130] [2024-10-14 20:56:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:12,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:12,183 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-10-14 20:56:12,185 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-10-14 20:56:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:12,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 20:56:12,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:12,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962276130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:12,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-10-14 20:56:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552178890] [2024-10-14 20:56:12,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 20:56:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 20:56:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 20:56:12,446 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:12,726 INFO L93 Difference]: Finished difference Result 174 states and 209 transitions. [2024-10-14 20:56:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 20:56:12,726 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 45 [2024-10-14 20:56:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:12,728 INFO L225 Difference]: With dead ends: 174 [2024-10-14 20:56:12,730 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 20:56:12,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:56:12,732 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 124 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:12,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 269 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 20:56:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 145. [2024-10-14 20:56:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 116 states have internal predecessors, (142), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 20:56:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 174 transitions. [2024-10-14 20:56:12,747 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 174 transitions. Word has length 45 [2024-10-14 20:56:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:12,747 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 174 transitions. [2024-10-14 20:56:12,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 174 transitions. [2024-10-14 20:56:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 20:56:12,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:12,748 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:12,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 20:56:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:12,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1326660547, now seen corresponding path program 1 times [2024-10-14 20:56:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861420634] [2024-10-14 20:56:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861420634] [2024-10-14 20:56:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861420634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:56:13,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:56:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 20:56:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317970407] [2024-10-14 20:56:13,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:56:13,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:56:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:56:13,055 INFO L87 Difference]: Start difference. First operand 145 states and 174 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 20:56:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:13,102 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2024-10-14 20:56:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:56:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 48 [2024-10-14 20:56:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:13,104 INFO L225 Difference]: With dead ends: 152 [2024-10-14 20:56:13,105 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 20:56:13,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:56:13,106 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:13,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 126 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:56:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 20:56:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 20:56:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 68 states have internal predecessors, (77), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-10-14 20:56:13,114 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 48 [2024-10-14 20:56:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:13,114 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-10-14 20:56:13,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 20:56:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-10-14 20:56:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 20:56:13,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:13,115 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:13,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:56:13,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:13,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1823196049, now seen corresponding path program 1 times [2024-10-14 20:56:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552698923] [2024-10-14 20:56:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:13,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552698923] [2024-10-14 20:56:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552698923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301844560] [2024-10-14 20:56:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:13,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:13,294 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-10-14 20:56:13,296 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-10-14 20:56:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:13,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 20:56:13,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:13,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301844560] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 20:56:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 8] total 22 [2024-10-14 20:56:13,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305165783] [2024-10-14 20:56:13,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:56:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 20:56:13,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 20:56:13,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2024-10-14 20:56:13,713 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:13,998 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-10-14 20:56:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 20:56:13,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2024-10-14 20:56:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:14,000 INFO L225 Difference]: With dead ends: 91 [2024-10-14 20:56:14,001 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 20:56:14,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2024-10-14 20:56:14,003 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:14,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:56:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 20:56:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 20:56:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 65 states have internal predecessors, (73), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 20:56:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-10-14 20:56:14,019 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 49 [2024-10-14 20:56:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:14,021 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-10-14 20:56:14,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 20:56:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-10-14 20:56:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 20:56:14,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:14,021 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:14,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 20:56:14,222 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,SelfDestructingSolverStorable8 [2024-10-14 20:56:14,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:14,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1982134855, now seen corresponding path program 1 times [2024-10-14 20:56:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130841767] [2024-10-14 20:56:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130841767] [2024-10-14 20:56:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130841767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981062294] [2024-10-14 20:56:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:14,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:14,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:14,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:14,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 20:56:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:14,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 20:56:14,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:14,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:14,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981062294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:14,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:14,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2024-10-14 20:56:14,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574421675] [2024-10-14 20:56:14,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:14,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 20:56:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:14,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 20:56:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-10-14 20:56:14,586 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:15,057 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-10-14 20:56:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 20:56:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 49 [2024-10-14 20:56:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:15,058 INFO L225 Difference]: With dead ends: 117 [2024-10-14 20:56:15,059 INFO L226 Difference]: Without dead ends: 116 [2024-10-14 20:56:15,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=339, Invalid=1301, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 20:56:15,060 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 140 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:15,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 219 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 20:56:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-14 20:56:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2024-10-14 20:56:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 20:56:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-10-14 20:56:15,074 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 49 [2024-10-14 20:56:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-10-14 20:56:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-10-14 20:56:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 20:56:15,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:15,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:15,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 20:56:15,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:15,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:15,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1965654570, now seen corresponding path program 1 times [2024-10-14 20:56:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530956087] [2024-10-14 20:56:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:15,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530956087] [2024-10-14 20:56:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530956087] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773567999] [2024-10-14 20:56:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:15,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:15,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 20:56:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:15,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 20:56:15,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 20:56:15,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 20:56:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773567999] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:16,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:16,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 26 [2024-10-14 20:56:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328280864] [2024-10-14 20:56:16,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:16,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 20:56:16,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 20:56:16,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-14 20:56:16,025 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:16,507 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2024-10-14 20:56:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 20:56:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 53 [2024-10-14 20:56:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:16,509 INFO L225 Difference]: With dead ends: 119 [2024-10-14 20:56:16,509 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 20:56:16,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=1817, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 20:56:16,510 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 142 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 239 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 20:56:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-14 20:56:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 70 states have internal predecessors, (72), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 20:56:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-10-14 20:56:16,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 53 [2024-10-14 20:56:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:16,524 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-10-14 20:56:16,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 7 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-14 20:56:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-10-14 20:56:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 20:56:16,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:56:16,525 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:16,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 20:56:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:16,726 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-14 20:56:16,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:56:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1170910788, now seen corresponding path program 2 times [2024-10-14 20:56:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:56:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211801552] [2024-10-14 20:56:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:56:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:56:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 20:56:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 20:56:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 20:56:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 20:56:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 20:56:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 20:56:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 20:56:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 20:56:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 20:56:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 20:56:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:56:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-14 20:56:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:56:16,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211801552] [2024-10-14 20:56:16,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211801552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 20:56:16,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457488497] [2024-10-14 20:56:16,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 20:56:16,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 20:56:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:56:16,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 20:56:16,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 20:56:17,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 20:56:17,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 20:56:17,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 20:56:17,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 20:56:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 77 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-14 20:56:17,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 20:56:17,329 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-14 20:56:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457488497] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 20:56:17,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 20:56:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 13 [2024-10-14 20:56:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463952690] [2024-10-14 20:56:17,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 20:56:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 20:56:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:56:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 20:56:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-14 20:56:17,333 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 7 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-14 20:56:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:56:17,650 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-10-14 20:56:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 20:56:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 7 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 85 [2024-10-14 20:56:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:56:17,651 INFO L225 Difference]: With dead ends: 90 [2024-10-14 20:56:17,651 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:56:17,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 178 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-10-14 20:56:17,652 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 20:56:17,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 20:56:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:56:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:56:17,653 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-10-14 20:56:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:56:17,653 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-14 20:56:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:56:17,653 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:56:17,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 7 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-10-14 20:56:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:56:17,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:56:17,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-14 20:56:17,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-14 20:56:17,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-14 20:56:17,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-14 20:56:17,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-14 20:56:17,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-14 20:56:17,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 20:56:17,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 20:56:17,866 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:56:17,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:56:17,972 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:56:17,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:56:17 BoogieIcfgContainer [2024-10-14 20:56:17,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:56:17,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:56:17,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:56:17,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:56:17,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:56:09" (3/4) ... [2024-10-14 20:56:17,988 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:56:17,992 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-14 20:56:17,992 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 20:56:17,995 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-14 20:56:17,995 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 20:56:17,995 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:56:17,996 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:56:17,996 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:56:18,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:56:18,104 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:56:18,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:56:18,106 INFO L158 Benchmark]: Toolchain (without parser) took 9033.41ms. Allocated memory was 230.7MB in the beginning and 293.6MB in the end (delta: 62.9MB). Free memory was 200.3MB in the beginning and 199.8MB in the end (delta: 423.8kB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,107 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:56:18,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 230.7MB. Free memory was 200.0MB in the beginning and 194.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.58ms. Allocated memory is still 230.7MB. Free memory was 194.4MB in the beginning and 192.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,107 INFO L158 Benchmark]: Boogie Preprocessor took 36.25ms. Allocated memory is still 230.7MB. Free memory was 192.4MB in the beginning and 190.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,108 INFO L158 Benchmark]: RCFGBuilder took 374.96ms. Allocated memory is still 230.7MB. Free memory was 190.3MB in the beginning and 175.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,108 INFO L158 Benchmark]: TraceAbstraction took 8193.40ms. Allocated memory was 230.7MB in the beginning and 293.6MB in the end (delta: 62.9MB). Free memory was 174.6MB in the beginning and 204.0MB in the end (delta: -29.5MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,108 INFO L158 Benchmark]: Witness Printer took 117.77ms. Allocated memory is still 293.6MB. Free memory was 204.0MB in the beginning and 199.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 20:56:18,109 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.79ms. Allocated memory is still 130.0MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 230.7MB. Free memory was 200.0MB in the beginning and 194.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.58ms. Allocated memory is still 230.7MB. Free memory was 194.4MB in the beginning and 192.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.25ms. Allocated memory is still 230.7MB. Free memory was 192.4MB in the beginning and 190.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.96ms. Allocated memory is still 230.7MB. Free memory was 190.3MB in the beginning and 175.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8193.40ms. Allocated memory was 230.7MB in the beginning and 293.6MB in the end (delta: 62.9MB). Free memory was 174.6MB in the beginning and 204.0MB in the end (delta: -29.5MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 117.77ms. Allocated memory is still 293.6MB. Free memory was 204.0MB in the beginning and 199.8MB in the end (delta: 4.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: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: 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 3 procedures, 42 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 2042 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1639 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1323 IncrementalHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 403 mSDtfsCounter, 1323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 644 SyntacticMatches, 5 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=7, InterpolantAutomatonStates: 159, 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, 74 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 816 NumberOfCodeBlocks, 816 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1075 ConstructedInterpolants, 0 QuantifiedInterpolants, 1955 SizeOfPredicates, 25 NumberOfNonLiveVariables, 723 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 983/1046 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 6 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((2 <= counter) && (counter <= 2147483645)) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((counter <= 2147483646) && (3 <= counter)) || (counter == 0)) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((counter == 1) || (counter == 2)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 20:56:18,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE