./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_25x0-1.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_25x0-1.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 8ec6e434f91e1569e6fad03794f07a751e615694ef413649174052dcc7984987 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:15:50,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:15:50,438 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,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:15:50,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:15:50,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:15:50,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:15:50,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:15:50,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:15:50,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:15:50,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:15:50,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:15:50,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:15:50,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:15:50,481 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:15:50,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:15:50,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:15:50,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:15:50,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:15:50,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:15:50,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:15:50,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:15:50,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:15:50,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:15:50,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:15:50,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:15:50,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:15:50,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:15:50,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:15:50,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:15:50,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:15:50,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:15:50,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:15:50,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:15:50,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:15:50,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:15:50,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:15:50,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:15:50,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:15:50,488 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 -> 8ec6e434f91e1569e6fad03794f07a751e615694ef413649174052dcc7984987 [2024-10-11 21:15:50,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:15:50,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:15:50,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:15:50,707 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:15:50,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:15:50,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-1.c [2024-10-11 21:15:51,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:15:52,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:15:52,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-1.c [2024-10-11 21:15:52,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43872cc9e/04b823e27c3e44d599fd743c0c315386/FLAG9fbf49d54 [2024-10-11 21:15:52,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43872cc9e/04b823e27c3e44d599fd743c0c315386 [2024-10-11 21:15:52,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:15:52,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:15:52,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:15:52,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:15:52,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:15:52,148 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,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b484949 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,149 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,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:15:52,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:15:52,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:15:52,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:15:52,303 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:15:52,304 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,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:15:52,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:15:52,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:15:52,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:15:52,310 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,317 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,327 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-11 21:15:52,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:15:52,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:15:52,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:15:52,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:15:52,336 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,337 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,337 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,345 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,346 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,346 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,347 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,348 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,349 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,349 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,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:15:52,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:15:52,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:15:52,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:15:52,365 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,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:15:52,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:52,397 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,404 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,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:15:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:15:52,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:15:52,455 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-11 21:15:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-11 21:15:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:15:52,502 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:15:52,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:15:52,626 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 21:15:52,626 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:15:52,664 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:15:52,664 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:15:52,665 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,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:15:52,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:15:52,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:15:52,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:15:52,674 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,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc3b43e 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,678 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,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc3b43e 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,678 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,679 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2024-10-11 21:15:52,709 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:15:52,709 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 21:15:52,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:15:52,823 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;@1d9cc5c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:15:52,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 21:15:52,828 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,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:15:52,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:52,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:15:52,836 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,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 71429977, now seen corresponding path program 1 times [2024-10-11 21:15:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563023266] [2024-10-11 21:15:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,065 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,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563023266] [2024-10-11 21:15:53,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563023266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:15:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801995518] [2024-10-11 21:15:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:15:53,094 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,203 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-11 21:15:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,205 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,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,211 INFO L225 Difference]: With dead ends: 56 [2024-10-11 21:15:53,211 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 21:15:53,213 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,216 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,217 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,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 21:15:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-11 21:15:53,241 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,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-11 21:15:53,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-11 21:15:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,244 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-11 21:15:53,244 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,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-11 21:15:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 21:15:53,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:15:53,245 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,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2080632986, now seen corresponding path program 1 times [2024-10-11 21:15:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534383132] [2024-10-11 21:15:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,290 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,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534383132] [2024-10-11 21:15:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534383132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:53,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:53,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:15:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610223194] [2024-10-11 21:15:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:53,292 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,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,402 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 21:15:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,403 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,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,404 INFO L225 Difference]: With dead ends: 37 [2024-10-11 21:15:53,405 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 21:15:53,405 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,406 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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,408 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,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 21:15:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-11 21:15:53,414 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,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-11 21:15:53,415 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-10-11 21:15:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,416 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-11 21:15:53,416 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,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-11 21:15:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 21:15:53,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:15:53,417 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,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -75113061, now seen corresponding path program 1 times [2024-10-11 21:15:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288228451] [2024-10-11 21:15:53,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,478 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,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288228451] [2024-10-11 21:15:53,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288228451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:53,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:15:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:15:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231125660] [2024-10-11 21:15:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:53,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:15:53,481 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,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,531 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-11 21:15:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:53,532 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,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,533 INFO L225 Difference]: With dead ends: 36 [2024-10-11 21:15:53,533 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 21:15:53,533 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,534 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,534 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,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 21:15:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 21:15:53,539 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,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-11 21:15:53,540 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-10-11 21:15:53,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,541 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-11 21:15:53,541 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,541 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-11 21:15:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 21:15:53,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,541 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:15:53,542 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,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1695709356, now seen corresponding path program 1 times [2024-10-11 21:15:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423585421] [2024-10-11 21:15:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,619 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,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:53,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423585421] [2024-10-11 21:15:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423585421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668542186] [2024-10-11 21:15:53,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:53,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:53,626 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,627 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,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:53,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:15:53,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:53,728 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,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:53,782 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,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668542186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:53,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:53,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 21:15:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67609671] [2024-10-11 21:15:53,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:53,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 21:15:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 21:15:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:15:53,785 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:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:53,913 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-11 21:15:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:15:53,913 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:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:53,914 INFO L225 Difference]: With dead ends: 87 [2024-10-11 21:15:53,914 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 21:15:53,915 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:53,916 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:53,916 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:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 21:15:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2024-10-11 21:15:53,935 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:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-11 21:15:53,937 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 12 [2024-10-11 21:15:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:53,937 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-11 21:15:53,937 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:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-11 21:15:53,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 21:15:53,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:53,942 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 21:15:53,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:15:54,142 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,144 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,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1783930154, now seen corresponding path program 1 times [2024-10-11 21:15:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493615702] [2024-10-11 21:15:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,279 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,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493615702] [2024-10-11 21:15:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493615702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141038254] [2024-10-11 21:15:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:54,281 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,284 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,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:15:54,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:54,394 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,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:15:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141038254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:54,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:15:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-11 21:15:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685047809] [2024-10-11 21:15:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:54,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:15:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:54,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:15:54,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:15:54,396 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,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:54,485 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-10-11 21:15:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:15:54,486 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,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:54,487 INFO L225 Difference]: With dead ends: 65 [2024-10-11 21:15:54,492 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 21:15:54,493 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,493 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:54,494 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.1s Time] [2024-10-11 21:15:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 21:15:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 21:15:54,516 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,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-11 21:15:54,517 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2024-10-11 21:15:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-11 21:15:54,517 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,517 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-11 21:15:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 21:15:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:54,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:15:54,548 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,722 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,723 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,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 532740141, now seen corresponding path program 1 times [2024-10-11 21:15:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445839056] [2024-10-11 21:15:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,787 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,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445839056] [2024-10-11 21:15:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445839056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245995193] [2024-10-11 21:15:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:54,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:54,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:54,790 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,791 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,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:54,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:15:54,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:54,857 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,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:54,915 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,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245995193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:54,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:54,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 21:15:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584095515] [2024-10-11 21:15:54,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 21:15:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 21:15:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 21:15:54,917 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,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:55,027 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-10-11 21:15:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 21:15:55,028 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,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:55,029 INFO L225 Difference]: With dead ends: 65 [2024-10-11 21:15:55,029 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 21:15:55,029 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,030 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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,030 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,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 21:15:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 21:15:55,040 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,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2024-10-11 21:15:55,041 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2024-10-11 21:15:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:55,041 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2024-10-11 21:15:55,042 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,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2024-10-11 21:15:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 21:15:55,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:55,042 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-11 21:15:55,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:15:55,246 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,247 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,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 381703833, now seen corresponding path program 2 times [2024-10-11 21:15:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660893305] [2024-10-11 21:15:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:55,372 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,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660893305] [2024-10-11 21:15:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660893305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207188314] [2024-10-11 21:15:55,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:15:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:55,374 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,375 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,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:15:55,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:55,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:15:55,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:55,445 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,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:55,602 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,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207188314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:55,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:55,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-11 21:15:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966851279] [2024-10-11 21:15:55,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:55,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 21:15:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 21:15:55,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-11 21:15:55,605 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:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:55,827 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-10-11 21:15:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 21:15:55,828 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:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:55,828 INFO L225 Difference]: With dead ends: 154 [2024-10-11 21:15:55,829 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 21:15:55,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 21:15:55,830 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:55,830 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.1s Time] [2024-10-11 21:15:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 21:15:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-10-11 21:15:55,844 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:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2024-10-11 21:15:55,846 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 33 [2024-10-11 21:15:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2024-10-11 21:15:55,846 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:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2024-10-11 21:15:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 21:15:55,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:55,847 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-10-11 21:15:55,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:15:56,051 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,052 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,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681720, now seen corresponding path program 2 times [2024-10-11 21:15:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211240402] [2024-10-11 21:15:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:56,237 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,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211240402] [2024-10-11 21:15:56,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211240402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:56,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642346202] [2024-10-11 21:15:56,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:15:56,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:56,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:56,240 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,247 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,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:15:56,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:56,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 21:15:56,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:56,425 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,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:56,663 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,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642346202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:56,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-11 21:15:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010915633] [2024-10-11 21:15:56,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:56,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 21:15:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 21:15:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-11 21:15:56,665 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:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:56,893 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-10-11 21:15:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 21:15:56,893 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:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:56,894 INFO L225 Difference]: With dead ends: 125 [2024-10-11 21:15:56,894 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 21:15:56,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 21:15:56,895 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:15:56,896 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.1s Time] [2024-10-11 21:15:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 21:15:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-10-11 21:15:56,905 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:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2024-10-11 21:15:56,905 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 36 [2024-10-11 21:15:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:56,906 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2024-10-11 21:15:56,906 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:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2024-10-11 21:15:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 21:15:56,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:56,907 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-10-11 21:15:56,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:15:57,111 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,112 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,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1050877305, now seen corresponding path program 3 times [2024-10-11 21:15:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578571827] [2024-10-11 21:15:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:57,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:57,514 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:57,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578571827] [2024-10-11 21:15:57,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578571827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:57,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484549131] [2024-10-11 21:15:57,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:15:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:57,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:57,518 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:57,522 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:57,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:15:57,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:15:57,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:15:57,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:57,639 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:57,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:15:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484549131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:15:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:15:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 29 [2024-10-11 21:15:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405751899] [2024-10-11 21:15:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:15:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:15:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:15:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-10-11 21:15:57,642 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:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:15:57,736 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2024-10-11 21:15:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:15:57,737 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:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:15:57,739 INFO L225 Difference]: With dead ends: 124 [2024-10-11 21:15:57,740 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 21:15:57,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-10-11 21:15:57,741 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:57,741 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:57,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 21:15:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-10-11 21:15:57,757 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:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2024-10-11 21:15:57,758 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 75 [2024-10-11 21:15:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:15:57,758 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2024-10-11 21:15:57,758 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:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2024-10-11 21:15:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 21:15:57,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:15:57,762 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-11 21:15:57,781 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:57,965 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:57,966 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:57,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:15:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1782541855, now seen corresponding path program 1 times [2024-10-11 21:15:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:15:57,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373760623] [2024-10-11 21:15:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:15:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:58,321 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,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:15:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373760623] [2024-10-11 21:15:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373760623] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:15:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593032645] [2024-10-11 21:15:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:15:58,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:15:58,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:15:58,324 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:58,325 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:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:15:58,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 21:15:58,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:15:58,838 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,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:15:59,538 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,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593032645] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:15:59,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:15:59,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2024-10-11 21:15:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998500447] [2024-10-11 21:15:59,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:15:59,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-11 21:15:59,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:15:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-11 21:15:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=4398, Unknown=0, NotChecked=0, Total=5112 [2024-10-11 21:15:59,542 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:00,835 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2024-10-11 21:16:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 21:16:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 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:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:00,837 INFO L225 Difference]: With dead ends: 295 [2024-10-11 21:16:00,837 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 21:16:00,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2028, Invalid=9102, Unknown=0, NotChecked=0, Total=11130 [2024-10-11 21:16:00,840 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 739 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:00,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 973 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:16:00,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 21:16:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2024-10-11 21:16:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 190 states have (on average 1.0736842105263158) internal successors, (204), 192 states have internal predecessors, (204), 24 states have call successors, (24), 23 states have call predecessors, (24), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 21:16:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 252 transitions. [2024-10-11 21:16:00,869 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 252 transitions. Word has length 76 [2024-10-11 21:16:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:00,869 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 252 transitions. [2024-10-11 21:16:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 252 transitions. [2024-10-11 21:16:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:16:00,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:00,871 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1] [2024-10-11 21:16:00,885 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:01,074 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:01,075 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:01,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1234632269, now seen corresponding path program 3 times [2024-10-11 21:16:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262626654] [2024-10-11 21:16:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:01,414 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:01,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262626654] [2024-10-11 21:16:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262626654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:01,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318041069] [2024-10-11 21:16:01,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:16:01,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:01,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:01,417 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:01,422 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:01,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-11 21:16:01,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:01,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 21:16:01,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:01,579 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:01,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:02,195 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,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318041069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:02,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2024-10-11 21:16:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38550962] [2024-10-11 21:16:02,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:02,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 21:16:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:02,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 21:16:02,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:16:02,202 INFO L87 Difference]: Start difference. First operand 240 states and 252 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:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:02,895 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2024-10-11 21:16:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 21:16:02,896 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:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:02,899 INFO L225 Difference]: With dead ends: 273 [2024-10-11 21:16:02,900 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 21:16:02,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 21:16:02,903 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 562 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:02,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 606 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:16:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 21:16:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2024-10-11 21:16:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 210 states have (on average 1.0333333333333334) internal successors, (217), 212 states have internal predecessors, (217), 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:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 269 transitions. [2024-10-11 21:16:02,917 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 269 transitions. Word has length 85 [2024-10-11 21:16:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 269 transitions. [2024-10-11 21:16:02,918 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:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 269 transitions. [2024-10-11 21:16:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 21:16:02,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:02,920 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2024-10-11 21:16:02,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:03,123 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:03,124 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:03,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 754549793, now seen corresponding path program 2 times [2024-10-11 21:16:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223261342] [2024-10-11 21:16:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223261342] [2024-10-11 21:16:04,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223261342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:04,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295776557] [2024-10-11 21:16:04,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 21:16:04,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:04,230 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:04,231 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:04,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 21:16:04,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:04,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 21:16:04,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:05,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295776557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:07,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 101 [2024-10-11 21:16:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399152313] [2024-10-11 21:16:07,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:07,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 21:16:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:07,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 21:16:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=8994, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 21:16:07,470 INFO L87 Difference]: Start difference. First operand 264 states and 269 transitions. Second operand has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:09,630 INFO L93 Difference]: Finished difference Result 358 states and 364 transitions. [2024-10-11 21:16:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 21:16:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-11 21:16:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:09,632 INFO L225 Difference]: With dead ends: 358 [2024-10-11 21:16:09,633 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 21:16:09,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 224 SyntacticMatches, 42 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4038, Invalid=18612, Unknown=0, NotChecked=0, Total=22650 [2024-10-11 21:16:09,637 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 1049 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:09,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1027 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:16:09,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 21:16:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-10-11 21:16:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.0186915887850467) internal successors, (218), 216 states have internal predecessors, (218), 27 states have call successors, (27), 26 states have call predecessors, (27), 26 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 21:16:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2024-10-11 21:16:09,650 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 160 [2024-10-11 21:16:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:09,651 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2024-10-11 21:16:09,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2024-10-11 21:16:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 21:16:09,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:09,652 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1] [2024-10-11 21:16:09,665 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:09,856 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:09,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:09,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -528459128, now seen corresponding path program 4 times [2024-10-11 21:16:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:09,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146255208] [2024-10-11 21:16:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146255208] [2024-10-11 21:16:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146255208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990903075] [2024-10-11 21:16:11,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 21:16:11,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:11,004 INFO L229 MonitoredProcess]: Starting monitored process 11 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:11,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:16:11,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 21:16:11,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:11,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 21:16:11,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:11,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:16:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990903075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:16:13,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:16:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 105 [2024-10-11 21:16:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888757725] [2024-10-11 21:16:13,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:16:13,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-10-11 21:16:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-10-11 21:16:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2764, Invalid=8578, Unknown=0, NotChecked=0, Total=11342 [2024-10-11 21:16:13,180 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:15,471 INFO L93 Difference]: Finished difference Result 648 states and 700 transitions. [2024-10-11 21:16:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-11 21:16:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-10-11 21:16:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:15,475 INFO L225 Difference]: With dead ends: 648 [2024-10-11 21:16:15,476 INFO L226 Difference]: Without dead ends: 647 [2024-10-11 21:16:15,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5442 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6641, Invalid=17851, Unknown=0, NotChecked=0, Total=24492 [2024-10-11 21:16:15,479 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1626 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:15,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 940 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:16:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-11 21:16:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 570. [2024-10-11 21:16:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 464 states have (on average 1.1142241379310345) internal successors, (517), 466 states have internal predecessors, (517), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 21:16:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 621 transitions. [2024-10-11 21:16:15,520 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 621 transitions. Word has length 176 [2024-10-11 21:16:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:15,520 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 621 transitions. [2024-10-11 21:16:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 621 transitions. [2024-10-11 21:16:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 21:16:15,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:15,522 INFO L215 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2024-10-11 21:16:15,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 21:16:15,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:16:15,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:15,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -271077658, now seen corresponding path program 3 times [2024-10-11 21:16:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254089484] [2024-10-11 21:16:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:16:16,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254089484] [2024-10-11 21:16:16,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254089484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:16:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375098686] [2024-10-11 21:16:16,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 21:16:16,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:16:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:16:16,839 INFO L229 MonitoredProcess]: Starting monitored process 12 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:16,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:16:16,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 21:16:16,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 21:16:16,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:16:16,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:16:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-10-11 21:16:17,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:16:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375098686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:17,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:16:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [54] total 59 [2024-10-11 21:16:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258449466] [2024-10-11 21:16:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:17,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:16:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:16:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=2693, Unknown=0, NotChecked=0, Total=3540 [2024-10-11 21:16:17,006 INFO L87 Difference]: Start difference. First operand 570 states and 621 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:16:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:17,116 INFO L93 Difference]: Finished difference Result 622 states and 674 transitions. [2024-10-11 21:16:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:16:17,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 181 [2024-10-11 21:16:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:17,119 INFO L225 Difference]: With dead ends: 622 [2024-10-11 21:16:17,119 INFO L226 Difference]: Without dead ends: 621 [2024-10-11 21:16:17,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=863, Invalid=3043, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 21:16:17,120 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:17,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:16:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-11 21:16:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 569. [2024-10-11 21:16:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 464 states have (on average 1.0581896551724137) internal successors, (491), 465 states have internal predecessors, (491), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 21:16:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 595 transitions. [2024-10-11 21:16:17,149 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 595 transitions. Word has length 181 [2024-10-11 21:16:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:17,149 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 595 transitions. [2024-10-11 21:16:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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:16:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 595 transitions. [2024-10-11 21:16:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-11 21:16:17,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:17,152 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:16:17,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 21:16:17,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:16:17,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:17,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -249705433, now seen corresponding path program 1 times [2024-10-11 21:16:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491529942] [2024-10-11 21:16:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:16:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 21:16:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3100 trivial. 0 not checked. [2024-10-11 21:16:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491529942] [2024-10-11 21:16:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491529942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:16:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709438002] [2024-10-11 21:16:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:16:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:16:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:16:17,888 INFO L87 Difference]: Start difference. First operand 569 states and 595 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:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:17,909 INFO L93 Difference]: Finished difference Result 569 states and 595 transitions. [2024-10-11 21:16:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:16:17,909 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 261 [2024-10-11 21:16:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:17,911 INFO L225 Difference]: With dead ends: 569 [2024-10-11 21:16:17,911 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 21:16:17,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:17,913 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:17,914 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:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 21:16:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2024-10-11 21:16:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 307 states have (on average 1.003257328990228) internal successors, (308), 307 states have internal predecessors, (308), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2024-10-11 21:16:17,928 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 261 [2024-10-11 21:16:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:17,930 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2024-10-11 21:16:17,930 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:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2024-10-11 21:16:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-11 21:16:17,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:16:17,933 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 51, 51, 50, 50, 1, 1, 1] [2024-10-11 21:16:17,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:16:17,933 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 21:16:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:16:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2143411048, now seen corresponding path program 5 times [2024-10-11 21:16:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:16:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366846908] [2024-10-11 21:16:17,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:16:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:16:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:16:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8875 backedges. 6675 proven. 0 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2024-10-11 21:16:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:16:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366846908] [2024-10-11 21:16:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366846908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:16:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:16:19,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2024-10-11 21:16:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291963851] [2024-10-11 21:16:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:16:19,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-11 21:16:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:16:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-11 21:16:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 21:16:19,537 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:16:20,199 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2024-10-11 21:16:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-11 21:16:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-10-11 21:16:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:16:20,200 INFO L225 Difference]: With dead ends: 359 [2024-10-11 21:16:20,200 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:16:20,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1836, Invalid=4644, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 21:16:20,201 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:16:20,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 504 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:16:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:16:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:16:20,203 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:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:16:20,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358 [2024-10-11 21:16:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:16:20,203 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:16:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:16:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:16:20,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:16:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 21:16:20,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 21:16:20,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 21:16:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:16:20,211 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 3, 1, 1, 1, 1, 1] [2024-10-11 21:16:20,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:16:33,938 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:16:34,101 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 21:16:34,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:16:34 BoogieIcfgContainer [2024-10-11 21:16:34,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:16:34,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:16:34,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:16:34,107 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:16:34,107 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:34,109 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:16:34,114 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-10-11 21:16:34,117 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:16:34,118 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 21:16:34,118 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:16:34,118 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:16:34,187 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:16:34,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:16:34,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:16:34,189 INFO L158 Benchmark]: Toolchain (without parser) took 42046.91ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 96.2MB in the beginning and 1.1GB in the end (delta: -997.8MB). Peak memory consumption was 420.0MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,189 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:16:34,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.35ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 84.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.62ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,190 INFO L158 Benchmark]: Boogie Preprocessor took 20.92ms. Allocated memory is still 167.8MB. Free memory was 83.1MB in the beginning and 81.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:16:34,190 INFO L158 Benchmark]: RCFGBuilder took 301.24ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 130.2MB in the end (delta: 8.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,190 INFO L158 Benchmark]: TraceAbstraction took 41435.72ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.2MB in the beginning and 1.1GB in the end (delta: -970.1MB). Peak memory consumption was 945.6MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,191 INFO L158 Benchmark]: Witness Printer took 81.51ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 21:16:34,192 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.35ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 84.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.62ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 83.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.92ms. Allocated memory is still 167.8MB. Free memory was 83.1MB in the beginning and 81.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.24ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 130.2MB in the end (delta: 8.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41435.72ms. Allocated memory was 167.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 129.2MB in the beginning and 1.1GB in the end (delta: -970.1MB). Peak memory consumption was 945.6MB. Max. memory is 16.1GB. * Witness Printer took 81.51ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 27.4s, OverallIterations: 16, TraceHistogramMax: 51, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4863 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4843 mSDsluCounter, 5126 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4597 mSDsCounter, 501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5487 IncrementalHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 501 mSolverCounterUnsat, 529 mSDtfsCounter, 5487 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1227 SyntacticMatches, 42 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20261 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=13, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 183 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 7447 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 14465/30896 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 <= 15) && (n <= 10)) && (0 <= (m + 2147483648))) && (7 <= n)) || (((m <= 7) && (18 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (m <= 16)) && (0 <= (m + 2147483648))) && (6 <= n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (m <= 10)) && (n <= 15))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 16)) && (m <= 9))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 24))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 2147483622))) || (((5 == n) && (0 <= (m + 2147483648))) && (m <= 20))) || (((20 == n) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 6) && (0 <= (m + 2147483648))) && (19 == n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 3)) && (m <= 22))) || (((m <= 8) && (n == 17)) && (0 <= (m + 2147483648)))) || ((((9 <= n) && (n <= 12)) && (0 <= (m + 2147483648))) && (m <= 13))) || ((n == 25) && (m == 0))) || (((m <= 12) && (0 <= (m + 2147483648))) && (n == 13))) || (((0 <= (m + 2147483648)) && (m <= 17)) && (8 == n))) || (((0 <= (m + 2147483648)) && (n == 24)) && (m <= 1))) || (((0 <= (m + 2147483648)) && (14 == n)) && (m <= 11))) || ((((m <= 4) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 21))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 4)) && (m <= 21))) || ((((3 <= n) && (0 <= (m + 2147483648))) && (n <= 6)) && (m <= 19))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 23))) || ((((m <= 14) && (n <= 11)) && (0 <= (m + 2147483648))) && (8 <= n))) || ((((0 <= (m + 2147483648)) && (m <= 2)) && (n <= 23)) && (2 <= n))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 22))) Ensures: (((((((((((((((((((((((((((((m <= 15) && (n <= 10)) && (0 <= (m + 2147483648))) && (7 <= n)) || (((m <= 7) && (18 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (m <= 16)) && (0 <= (m + 2147483648))) && (6 <= n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (m <= 10)) && (n <= 15))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 16)) && (m <= 9))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 24))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 2147483622))) || (((5 == n) && (0 <= (m + 2147483648))) && (m <= 20))) || (((20 == n) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 6) && (0 <= (m + 2147483648))) && (19 == n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 3)) && (m <= 22))) || (((m <= 8) && (n == 17)) && (0 <= (m + 2147483648)))) || ((((9 <= n) && (n <= 12)) && (0 <= (m + 2147483648))) && (m <= 13))) || ((n == 25) && (m == 0))) || (((m <= 12) && (0 <= (m + 2147483648))) && (n == 13))) || (((0 <= (m + 2147483648)) && (m <= 17)) && (8 == n))) || (((0 <= (m + 2147483648)) && (n == 24)) && (m <= 1))) || (((0 <= (m + 2147483648)) && (14 == n)) && (m <= 11))) || ((((m <= 4) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 21))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 4)) && (m <= 21))) || ((((3 <= n) && (0 <= (m + 2147483648))) && (n <= 6)) && (m <= 19))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 23))) || ((((m <= 14) && (n <= 11)) && (0 <= (m + 2147483648))) && (8 <= n))) || ((((0 <= (m + 2147483648)) && (m <= 2)) && (n <= 23)) && (2 <= n))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 22))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:16:34,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE