./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2467b918f90fe26ead39772ec36304202be3f16a6c04dfdd5844d39d05599b5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:15:49,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:15:50,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:15:50,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:15:50,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:15:50,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:15:50,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:15:50,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:15:50,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:15:50,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:15:50,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:15:50,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:15:50,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:15:50,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:15:50,097 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:15:50,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:15:50,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:15:50,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:15:50,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:15:50,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:15:50,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:15:50,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:15:50,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:15:50,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:15:50,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:15:50,105 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:15:50,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:15:50,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:15:50,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:15:50,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:15:50,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:15:50,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:15:50,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:15:50,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:15:50,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:15:50,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:15:50,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:15:50,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:15:50,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:15:50,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:15:50,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:15:50,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:15:50,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:15:50,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:15:50,113 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-clean/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-clean/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 -> 2467b918f90fe26ead39772ec36304202be3f16a6c04dfdd5844d39d05599b5a [2024-10-11 21:15:50,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:15:50,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:15:50,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:15:50,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:15:50,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:15:50,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c [2024-10-11 21:15:51,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:15:52,007 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:15:52,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c [2024-10-11 21:15:52,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26529c020/c7000dc70a8c488abac8eaafc52228bf/FLAGbc5318808 [2024-10-11 21:15:52,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26529c020/c7000dc70a8c488abac8eaafc52228bf [2024-10-11 21:15:52,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:15:52,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:15:52,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:15:52,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:15:52,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:15:52,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7178682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52, skipping insertion in model container [2024-10-11 21:15:52,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:15:52,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:15:52,227 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:15:52,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:15:52,251 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:15:52,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52 WrapperNode [2024-10-11 21:15:52,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:15:52,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:15:52,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:15:52,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:15:52,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,305 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-11 21:15:52,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:15:52,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:15:52,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:15:52,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:15:52,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,366 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:15:52,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:15:52,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:15:52,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:15:52,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:15:52,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (1/1) ... [2024-10-11 21:15:52,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:15:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:52,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:15:52,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:15:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:15:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:15:52,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:15:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-11 21:15:52,446 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-11 21:15:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:15:52,511 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:15:52,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:15:52,617 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 21:15:52,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:15:52,638 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:15:52,638 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:15:52,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:15:52 BoogieIcfgContainer [2024-10-11 21:15:52,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:15:52,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:15:52,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:15:52,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:15:52,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:15:52" (1/3) ... [2024-10-11 21:15:52,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1280470c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:15:52, skipping insertion in model container [2024-10-11 21:15:52,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:15:52" (2/3) ... [2024-10-11 21:15:52,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1280470c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:15:52, skipping insertion in model container [2024-10-11 21:15:52,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:15:52" (3/3) ... [2024-10-11 21:15:52,654 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0-2.c [2024-10-11 21:15:52,671 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:15:52,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 21:15:52,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:15:52,744 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;@344d0adf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:15:52,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 21:15:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:15:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:15:52,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:52,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:15:52,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:52,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash 71429977, now seen corresponding path program 1 times [2024-10-11 21:15:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144643125] [2024-10-11 21:15:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:52,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:52,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144643125] [2024-10-11 21:15:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144643125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:15:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897750885] [2024-10-11 21:15:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:53,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:15:53,021 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,157 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-11 21:15:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 21:15:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,167 INFO L225 Difference]: With dead ends: 56 [2024-10-11 21:15:53,167 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 21:15:53,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11 21:15:53,173 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:53,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:15:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 21:15:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-11 21:15:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:15:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-11 21:15:53,208 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-11 21:15:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,208 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-11 21:15:53,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-11 21:15:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:15:53,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:15:53,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:53,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2080632986, now seen corresponding path program 1 times [2024-10-11 21:15:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993456237] [2024-10-11 21:15:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993456237] [2024-10-11 21:15:53,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993456237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:53,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:53,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:15:53,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740387244] [2024-10-11 21:15:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:15:53,293 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,373 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 21:15:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 21:15:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,376 INFO L225 Difference]: With dead ends: 37 [2024-10-11 21:15:53,377 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 21:15:53,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11 21:15:53,379 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:53,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:15:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 21:15:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-11 21:15:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:15:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-11 21:15:53,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-10-11 21:15:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,395 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-11 21:15:53,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-11 21:15:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 21:15:53,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:15:53,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -75113061, now seen corresponding path program 1 times [2024-10-11 21:15:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991976682] [2024-10-11 21:15:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991976682] [2024-10-11 21:15:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991976682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:15:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156755832] [2024-10-11 21:15:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:15:53,513 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,574 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-11 21:15:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 21:15:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,575 INFO L225 Difference]: With dead ends: 36 [2024-10-11 21:15:53,575 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 21:15:53,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11 21:15:53,576 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:53,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:15:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 21:15:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 21:15:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:15:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-11 21:15:53,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-10-11 21:15:53,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,583 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-11 21:15:53,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-11 21:15:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 21:15:53,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,584 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:15:53,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:53,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1695709356, now seen corresponding path program 1 times [2024-10-11 21:15:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190316148] [2024-10-11 21:15:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190316148] [2024-10-11 21:15:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190316148] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954443235] [2024-10-11 21:15:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:53,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:53,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:53,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:15:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:15:53,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:53,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954443235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:53,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 21:15:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263065563] [2024-10-11 21:15:53,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:15:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:15:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:15:53,956 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:54,129 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-11 21:15:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:15:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 21:15:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:54,131 INFO L225 Difference]: With dead ends: 87 [2024-10-11 21:15:54,131 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 21:15:54,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:15:54,133 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:54,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 109 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:15:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 21:15:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2024-10-11 21:15:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 51 states have internal predecessors, (58), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:15:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-11 21:15:54,149 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 12 [2024-10-11 21:15:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:54,150 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-11 21:15:54,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-11 21:15:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:15:54,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:54,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:54,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 21:15:54,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:54,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1783930154, now seen corresponding path program 1 times [2024-10-11 21:15:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550384304] [2024-10-11 21:15:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550384304] [2024-10-11 21:15:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550384304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774845754] [2024-10-11 21:15:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:54,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:54,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:15:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:15:54,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:54,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:15:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774845754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:15:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 21:15:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283838289] [2024-10-11 21:15:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:54,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:15:54,557 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:54,622 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-10-11 21:15:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 21:15:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:54,626 INFO L225 Difference]: With dead ends: 65 [2024-10-11 21:15:54,626 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 21:15:54,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:15:54,627 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:54,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:15:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 21:15:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 21:15:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:15:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-11 21:15:54,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2024-10-11 21:15:54,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-11 21:15:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-11 21:15:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 21:15:54,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:54,650 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:15:54,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:15:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:54,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 532740141, now seen corresponding path program 1 times [2024-10-11 21:15:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931123463] [2024-10-11 21:15:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931123463] [2024-10-11 21:15:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931123463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469036418] [2024-10-11 21:15:54,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:54,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:15:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:15:54,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:55,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:55,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469036418] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:55,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:55,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 21:15:55,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631457880] [2024-10-11 21:15:55,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:55,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 21:15:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:55,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 21:15:55,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:15:55,084 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:55,220 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-10-11 21:15:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:15:55,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 21:15:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:55,221 INFO L225 Difference]: With dead ends: 65 [2024-10-11 21:15:55,221 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 21:15:55,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:15:55,222 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:55,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 104 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:15:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 21:15:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 21:15:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.108695652173913) internal successors, (51), 50 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 21:15:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2024-10-11 21:15:55,238 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2024-10-11 21:15:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2024-10-11 21:15:55,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2024-10-11 21:15:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 21:15:55,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:55,239 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-11 21:15:55,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:15:55,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:55,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash 381703833, now seen corresponding path program 2 times [2024-10-11 21:15:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828462325] [2024-10-11 21:15:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828462325] [2024-10-11 21:15:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828462325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384417620] [2024-10-11 21:15:55,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:15:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:55,644 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:55,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:15:55,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:15:55,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:55,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:15:55,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:55,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384417620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:55,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-11 21:15:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841506873] [2024-10-11 21:15:55,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:55,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:15:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:15:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:15:55,992 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:56,339 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-10-11 21:15:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 21:15:56,340 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 21:15:56,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:56,341 INFO L225 Difference]: With dead ends: 154 [2024-10-11 21:15:56,341 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 21:15:56,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 21:15:56,343 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 182 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:56,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 229 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:15:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 21:15:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-10-11 21:15:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 98 states have internal predecessors, (105), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:15:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2024-10-11 21:15:56,373 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 33 [2024-10-11 21:15:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:56,375 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2024-10-11 21:15:56,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2024-10-11 21:15:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 21:15:56,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:56,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-10-11 21:15:56,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:15:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 21:15:56,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681720, now seen corresponding path program 2 times [2024-10-11 21:15:56,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664016537] [2024-10-11 21:15:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664016537] [2024-10-11 21:15:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664016537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355171792] [2024-10-11 21:15:56,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:15:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:56,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:56,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:15:56,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:15:56,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:56,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:15:56,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:56,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355171792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:57,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-11 21:15:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935116928] [2024-10-11 21:15:57,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:57,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:15:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:15:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:15:57,075 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:57,394 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-10-11 21:15:57,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 21:15:57,394 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-10-11 21:15:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:57,395 INFO L225 Difference]: With dead ends: 125 [2024-10-11 21:15:57,395 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 21:15:57,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 21:15:57,397 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 216 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:57,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 303 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:15:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 21:15:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-10-11 21:15:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.053191489361702) internal successors, (99), 98 states have internal predecessors, (99), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:15:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2024-10-11 21:15:57,416 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 36 [2024-10-11 21:15:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:57,416 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2024-10-11 21:15:57,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2024-10-11 21:15:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:15:57,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:57,422 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-10-11 21:15:57,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:15:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:57,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:57,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1050877305, now seen corresponding path program 3 times [2024-10-11 21:15:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374774662] [2024-10-11 21:15:57,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374774662] [2024-10-11 21:15:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374774662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481791018] [2024-10-11 21:15:58,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:15:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:58,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:58,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:15:58,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:15:58,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:58,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:15:58,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-11 21:15:58,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:15:58,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481791018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:58,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:15:58,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 29 [2024-10-11 21:15:58,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558152954] [2024-10-11 21:15:58,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:58,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:15:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:15:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-10-11 21:15:58,284 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:58,404 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2024-10-11 21:15:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:15:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 21:15:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:58,406 INFO L225 Difference]: With dead ends: 124 [2024-10-11 21:15:58,406 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 21:15:58,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-10-11 21:15:58,407 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:58,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:15:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 21:15:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-10-11 21:15:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 97 states have internal predecessors, (98), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 21:15:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2024-10-11 21:15:58,419 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 75 [2024-10-11 21:15:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:58,420 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2024-10-11 21:15:58,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:15:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2024-10-11 21:15:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:15:58,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:58,421 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-11 21:15:58,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 21:15:58,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 21:15:58,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:15:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1782541855, now seen corresponding path program 1 times [2024-10-11 21:15:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485906427] [2024-10-11 21:15:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485906427] [2024-10-11 21:15:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485906427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008221376] [2024-10-11 21:15:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:59,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:59,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:59,060 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:15:59,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:15:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:59,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 21:15:59,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:15:59,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008221376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:00,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:00,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2024-10-11 21:16:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470134607] [2024-10-11 21:16:00,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:00,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-11 21:16:00,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-11 21:16:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3932, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 21:16:00,549 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:01,881 INFO L93 Difference]: Finished difference Result 273 states and 294 transitions. [2024-10-11 21:16:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 21:16:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 21:16:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:01,884 INFO L225 Difference]: With dead ends: 273 [2024-10-11 21:16:01,884 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 21:16:01,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1785, Invalid=8115, Unknown=0, NotChecked=0, Total=9900 [2024-10-11 21:16:01,887 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 645 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:01,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 868 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:16:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 21:16:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2024-10-11 21:16:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 174 states have (on average 1.0689655172413792) internal successors, (186), 176 states have internal predecessors, (186), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 21:16:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 230 transitions. [2024-10-11 21:16:01,905 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 230 transitions. Word has length 76 [2024-10-11 21:16:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 230 transitions. [2024-10-11 21:16:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 2.8615384615384616) internal successors, (186), 36 states have internal predecessors, (186), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 230 transitions. [2024-10-11 21:16:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:16:01,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:01,908 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1] [2024-10-11 21:16:01,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 21:16:02,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:02,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:02,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1234632269, now seen corresponding path program 3 times [2024-10-11 21:16:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:02,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104037557] [2024-10-11 21:16:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104037557] [2024-10-11 21:16:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104037557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602406346] [2024-10-11 21:16:02,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:16:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:02,608 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:02,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:16:02,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-11 21:16:02,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:02,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 21:16:02,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:02,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:03,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602406346] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:03,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:03,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2024-10-11 21:16:03,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478155082] [2024-10-11 21:16:03,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:03,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 21:16:03,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:03,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 21:16:03,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:16:03,492 INFO L87 Difference]: Start difference. First operand 220 states and 230 transitions. Second operand has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:04,356 INFO L93 Difference]: Finished difference Result 283 states and 301 transitions. [2024-10-11 21:16:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 21:16:04,357 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 21:16:04,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:04,359 INFO L225 Difference]: With dead ends: 283 [2024-10-11 21:16:04,359 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 21:16:04,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 21:16:04,362 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 444 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:04,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 662 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:16:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 21:16:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2024-10-11 21:16:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 214 states have (on average 1.0514018691588785) internal successors, (225), 216 states have internal predecessors, (225), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 21:16:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 277 transitions. [2024-10-11 21:16:04,388 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 277 transitions. Word has length 85 [2024-10-11 21:16:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 277 transitions. [2024-10-11 21:16:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 277 transitions. [2024-10-11 21:16:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 21:16:04,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:04,390 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2024-10-11 21:16:04,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:16:04,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:16:04,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:04,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1511407553, now seen corresponding path program 2 times [2024-10-11 21:16:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:04,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806997683] [2024-10-11 21:16:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:05,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806997683] [2024-10-11 21:16:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806997683] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:05,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424022089] [2024-10-11 21:16:05,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:16:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:05,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:05,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:16:05,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:16:05,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:16:05,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:05,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 21:16:05,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:06,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424022089] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:07,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 92 [2024-10-11 21:16:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986244412] [2024-10-11 21:16:07,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-10-11 21:16:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-10-11 21:16:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=6723, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 21:16:07,634 INFO L87 Difference]: Start difference. First operand 268 states and 277 transitions. Second operand has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:10,079 INFO L93 Difference]: Finished difference Result 517 states and 577 transitions. [2024-10-11 21:16:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-10-11 21:16:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2024-10-11 21:16:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:10,082 INFO L225 Difference]: With dead ends: 517 [2024-10-11 21:16:10,082 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 21:16:10,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6112 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5898, Invalid=19224, Unknown=0, NotChecked=0, Total=25122 [2024-10-11 21:16:10,088 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1587 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:10,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 844 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:16:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 21:16:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 471. [2024-10-11 21:16:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 384 states have (on average 1.0598958333333333) internal successors, (407), 385 states have internal predecessors, (407), 43 states have call successors, (43), 42 states have call predecessors, (43), 42 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 21:16:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 493 transitions. [2024-10-11 21:16:10,120 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 493 transitions. Word has length 146 [2024-10-11 21:16:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 493 transitions. [2024-10-11 21:16:10,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 90 states have (on average 2.888888888888889) internal successors, (260), 50 states have internal predecessors, (260), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 493 transitions. [2024-10-11 21:16:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 21:16:10,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:10,124 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:10,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:10,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash -756686655, now seen corresponding path program 1 times [2024-10-11 21:16:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740855943] [2024-10-11 21:16:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:16:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2024-10-11 21:16:10,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740855943] [2024-10-11 21:16:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740855943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:16:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856131758] [2024-10-11 21:16:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:10,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:16:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:16:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:16:10,856 INFO L87 Difference]: Start difference. First operand 471 states and 493 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:10,882 INFO L93 Difference]: Finished difference Result 471 states and 493 transitions. [2024-10-11 21:16:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:16:10,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 211 [2024-10-11 21:16:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:10,884 INFO L225 Difference]: With dead ends: 471 [2024-10-11 21:16:10,884 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 21:16:10,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:16:10,888 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 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-11 21:16:10,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 21:16:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2024-10-11 21:16:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 253 states have (on average 1.0039525691699605) internal successors, (254), 253 states have internal predecessors, (254), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2024-10-11 21:16:10,904 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 211 [2024-10-11 21:16:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2024-10-11 21:16:10,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:16:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2024-10-11 21:16:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-11 21:16:10,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:10,908 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 1, 1, 1] [2024-10-11 21:16:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:16:10,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2069659821, now seen corresponding path program 4 times [2024-10-11 21:16:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089595156] [2024-10-11 21:16:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 4432 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-10-11 21:16:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089595156] [2024-10-11 21:16:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089595156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:12,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:12,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-10-11 21:16:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644949791] [2024-10-11 21:16:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:12,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 21:16:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 21:16:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 21:16:12,325 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:12,874 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2024-10-11 21:16:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 21:16:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2024-10-11 21:16:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:12,876 INFO L225 Difference]: With dead ends: 296 [2024-10-11 21:16:12,876 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:16:12,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1221, Invalid=3069, Unknown=0, NotChecked=0, Total=4290 [2024-10-11 21:16:12,878 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 121 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:12,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 335 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:16:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:16:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:16:12,879 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-11 21:16:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:16:12,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2024-10-11 21:16:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:12,879 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:16:12,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.9545454545454546) internal successors, (130), 23 states have internal predecessors, (130), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:16:12,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:16:12,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 21:16:12,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 21:16:12,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 21:16:12,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:16:12,887 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2024-10-11 21:16:12,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:16:19,339 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:16:19,498 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 21:16:19,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:16:19 BoogieIcfgContainer [2024-10-11 21:16:19,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:16:19,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:16:19,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:16:19,509 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:16:19,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:15:52" (3/4) ... [2024-10-11 21:16:19,511 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:16:19,515 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-10-11 21:16:19,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:16:19,519 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:16:19,520 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:16:19,520 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:16:19,619 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:16:19,619 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:16:19,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:16:19,620 INFO L158 Benchmark]: Toolchain (without parser) took 27591.68ms. Allocated memory was 159.4MB in the beginning and 543.2MB in the end (delta: 383.8MB). Free memory was 90.3MB in the beginning and 392.1MB in the end (delta: -301.8MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,620 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 159.4MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:16:19,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.09ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 78.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.30ms. Allocated memory is still 159.4MB. Free memory was 78.6MB in the beginning and 131.6MB in the end (delta: -53.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,621 INFO L158 Benchmark]: Boogie Preprocessor took 64.78ms. Allocated memory is still 159.4MB. Free memory was 131.6MB in the beginning and 129.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,621 INFO L158 Benchmark]: RCFGBuilder took 262.95ms. Allocated memory is still 159.4MB. Free memory was 129.9MB in the beginning and 118.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,621 INFO L158 Benchmark]: TraceAbstraction took 26863.25ms. Allocated memory was 159.4MB in the beginning and 543.2MB in the end (delta: 383.8MB). Free memory was 117.9MB in the beginning and 396.3MB in the end (delta: -278.4MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,622 INFO L158 Benchmark]: Witness Printer took 110.84ms. Allocated memory is still 543.2MB. Free memory was 396.3MB in the beginning and 392.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:16:19,623 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 159.4MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.09ms. Allocated memory is still 159.4MB. Free memory was 90.1MB in the beginning and 78.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.30ms. Allocated memory is still 159.4MB. Free memory was 78.6MB in the beginning and 131.6MB in the end (delta: -53.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.78ms. Allocated memory is still 159.4MB. Free memory was 131.6MB in the beginning and 129.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.95ms. Allocated memory is still 159.4MB. Free memory was 129.9MB in the beginning and 118.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26863.25ms. Allocated memory was 159.4MB in the beginning and 543.2MB in the end (delta: 383.8MB). Free memory was 117.9MB in the beginning and 396.3MB in the end (delta: -278.4MB). Peak memory consumption was 318.3MB. Max. memory is 16.1GB. * Witness Printer took 110.84ms. Allocated memory is still 543.2MB. Free memory was 396.3MB in the beginning and 392.1MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: 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 2 procedures, 28 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 14, TraceHistogramMax: 42, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3510 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3493 mSDsluCounter, 3721 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3306 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3756 IncrementalHoareTripleChecker+Invalid, 4163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 415 mSDtfsCounter, 3756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1312 GetRequests, 762 SyntacticMatches, 4 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11311 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=12, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1445 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1881 ConstructedInterpolants, 0 QuantifiedInterpolants, 4841 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 8306/15486 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum. Requires: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) Ensures: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:16:19,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE