./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.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 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:20:16,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:20:16,357 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:20:16,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:20:16,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:20:16,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:20:16,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:20:16,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:20:16,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:20:16,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:20:16,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:20:16,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:20:16,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:20:16,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:20:16,410 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:20:16,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:20:16,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:20:16,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:20:16,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:20:16,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:20:16,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:20:16,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:20:16,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:20:16,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:20:16,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:20:16,416 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:20:16,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:20:16,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:20:16,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:20:16,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:20:16,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:20:16,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:20:16,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:16,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:20:16,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:20:16,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:20:16,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:20:16,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:20:16,419 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 -> 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f [2024-10-11 21:20:16,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:20:16,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:20:16,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:20:16,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:20:16,647 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:20:16,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:17,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:20:18,118 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:20:18,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:18,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b693994d/87cb9cc0c45144fcbdaa6acb69ee6a54/FLAG4f0d8d6e6 [2024-10-11 21:20:18,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b693994d/87cb9cc0c45144fcbdaa6acb69ee6a54 [2024-10-11 21:20:18,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:20:18,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:20:18,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:18,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:20:18,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:20:18,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656933ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18, skipping insertion in model container [2024-10-11 21:20:18,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:20:18,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:18,736 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:20:18,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:20:18,800 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:20:18,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18 WrapperNode [2024-10-11 21:20:18,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:20:18,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:18,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:20:18,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:20:18,809 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:20:18" (1/1) ... [2024-10-11 21:20:18,817 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:20:18" (1/1) ... [2024-10-11 21:20:18,854 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 237 [2024-10-11 21:20:18,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:20:18,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:20:18,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:20:18,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:20:18,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,893 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:20:18,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:20:18,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:20:18,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:20:18,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:20:18,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (1/1) ... [2024-10-11 21:20:18,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:20:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:20:18,972 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:20:18,974 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:20:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:20:19,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:20:19,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:20:19,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:20:19,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:20:19,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:20:19,404 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-11 21:20:19,405 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:20:19,431 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:20:19,431 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:20:19,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:19 BoogieIcfgContainer [2024-10-11 21:20:19,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:20:19,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:20:19,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:20:19,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:20:19,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:20:18" (1/3) ... [2024-10-11 21:20:19,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7ea1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:19, skipping insertion in model container [2024-10-11 21:20:19,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:20:18" (2/3) ... [2024-10-11 21:20:19,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b7ea1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:20:19, skipping insertion in model container [2024-10-11 21:20:19,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:19" (3/3) ... [2024-10-11 21:20:19,437 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2024-10-11 21:20:19,449 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:20:19,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-10-11 21:20:19,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:20:19,509 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;@4e07f301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:20:19,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-10-11 21:20:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 77 states have internal predecessors, (115), 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:20:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 21:20:19,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:19,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:19,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1654803037, now seen corresponding path program 1 times [2024-10-11 21:20:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319121683] [2024-10-11 21:20:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,666 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:20:19,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:19,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319121683] [2024-10-11 21:20:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319121683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:19,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:20:19,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136352031] [2024-10-11 21:20:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:19,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:20:19,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:19,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:20:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:20:19,687 INFO L87 Difference]: Start difference. First operand has 78 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 77 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:20:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:19,710 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2024-10-11 21:20:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:20:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 21:20:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:19,717 INFO L225 Difference]: With dead ends: 133 [2024-10-11 21:20:19,717 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 21:20:19,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:20:19,721 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:19,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 21:20:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 21:20:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 73 states have internal predecessors, (108), 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:20:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2024-10-11 21:20:19,746 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 9 [2024-10-11 21:20:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:19,747 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2024-10-11 21:20:19,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:20:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2024-10-11 21:20:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 21:20:19,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:19,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:19,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:20:19,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:19,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash -130395990, now seen corresponding path program 1 times [2024-10-11 21:20:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:19,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030924835] [2024-10-11 21:20:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,836 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:20:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030924835] [2024-10-11 21:20:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030924835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287125621] [2024-10-11 21:20:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:19,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:19,840 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:19,874 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2024-10-11 21:20:19,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 21:20:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:19,875 INFO L225 Difference]: With dead ends: 131 [2024-10-11 21:20:19,875 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 21:20:19,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:19,876 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:19,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 21:20:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 21:20:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 73 states have internal predecessors, (92), 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:20:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-10-11 21:20:19,882 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 13 [2024-10-11 21:20:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:19,882 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-10-11 21:20:19,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-10-11 21:20:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 21:20:19,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:19,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:19,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:20:19,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:19,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2117655363, now seen corresponding path program 1 times [2024-10-11 21:20:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688580036] [2024-10-11 21:20:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:19,978 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:20:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:19,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688580036] [2024-10-11 21:20:19,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688580036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:19,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:19,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791382858] [2024-10-11 21:20:19,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:19,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:19,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:19,981 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,088 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2024-10-11 21:20:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 21:20:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,090 INFO L225 Difference]: With dead ends: 125 [2024-10-11 21:20:20,090 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 21:20:20,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:20,091 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 212 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 105 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 21:20:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2024-10-11 21:20:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.5480769230769231) internal successors, (161), 115 states have internal predecessors, (161), 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:20:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2024-10-11 21:20:20,103 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 28 [2024-10-11 21:20:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,103 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2024-10-11 21:20:20,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2024-10-11 21:20:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 21:20:20,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:20,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:20:20,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:20,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1222806574, now seen corresponding path program 1 times [2024-10-11 21:20:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786841473] [2024-10-11 21:20:20,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,199 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:20:20,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786841473] [2024-10-11 21:20:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786841473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:20,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:20,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108148330] [2024-10-11 21:20:20,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:20,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:20,203 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:20:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,332 INFO L93 Difference]: Finished difference Result 218 states and 299 transitions. [2024-10-11 21:20:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:20,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 21:20:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,334 INFO L225 Difference]: With dead ends: 218 [2024-10-11 21:20:20,334 INFO L226 Difference]: Without dead ends: 215 [2024-10-11 21:20:20,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:20,335 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 202 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 157 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-11 21:20:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2024-10-11 21:20:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 146 states have (on average 1.5547945205479452) internal successors, (227), 157 states have internal predecessors, (227), 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:20:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 227 transitions. [2024-10-11 21:20:20,345 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 227 transitions. Word has length 29 [2024-10-11 21:20:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,346 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 227 transitions. [2024-10-11 21:20:20,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:20:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 227 transitions. [2024-10-11 21:20:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 21:20:20,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:20,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:20:20,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash 747702111, now seen corresponding path program 1 times [2024-10-11 21:20:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332929433] [2024-10-11 21:20:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,480 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:20:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332929433] [2024-10-11 21:20:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332929433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106058566] [2024-10-11 21:20:20,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:20,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:20,481 INFO L87 Difference]: Start difference. First operand 158 states and 227 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:20:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,634 INFO L93 Difference]: Finished difference Result 257 states and 368 transitions. [2024-10-11 21:20:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:20,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 21:20:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,636 INFO L225 Difference]: With dead ends: 257 [2024-10-11 21:20:20,636 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 21:20:20,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:20,637 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 461 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 185 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 21:20:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 242. [2024-10-11 21:20:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 230 states have (on average 1.5608695652173914) internal successors, (359), 241 states have internal predecessors, (359), 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:20:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2024-10-11 21:20:20,653 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 30 [2024-10-11 21:20:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2024-10-11 21:20:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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:20:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2024-10-11 21:20:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 21:20:20,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:20:20,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1703929204, now seen corresponding path program 1 times [2024-10-11 21:20:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282179920] [2024-10-11 21:20:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,717 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:20:20,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282179920] [2024-10-11 21:20:20,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282179920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:20,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759225383] [2024-10-11 21:20:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:20,720 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:20:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,905 INFO L93 Difference]: Finished difference Result 737 states and 1097 transitions. [2024-10-11 21:20:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-11 21:20:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,907 INFO L225 Difference]: With dead ends: 737 [2024-10-11 21:20:20,907 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 21:20:20,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:20,909 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 458 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 300 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 21:20:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 368. [2024-10-11 21:20:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.5224719101123596) internal successors, (542), 367 states have internal predecessors, (542), 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:20:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 542 transitions. [2024-10-11 21:20:20,923 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 542 transitions. Word has length 31 [2024-10-11 21:20:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 542 transitions. [2024-10-11 21:20:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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:20:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 542 transitions. [2024-10-11 21:20:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 21:20:20,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:20,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:20:20,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 377658330, now seen corresponding path program 1 times [2024-10-11 21:20:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819102] [2024-10-11 21:20:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,963 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:20:20,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819102] [2024-10-11 21:20:20,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:20,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926481996] [2024-10-11 21:20:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:20,966 INFO L87 Difference]: Start difference. First operand 368 states and 542 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:20:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:20,990 INFO L93 Difference]: Finished difference Result 1032 states and 1530 transitions. [2024-10-11 21:20:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:20,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 21:20:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:20,994 INFO L225 Difference]: With dead ends: 1032 [2024-10-11 21:20:20,995 INFO L226 Difference]: Without dead ends: 684 [2024-10-11 21:20:20,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20:20,999 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:20,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 211 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-10-11 21:20:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 672. [2024-10-11 21:20:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 660 states have (on average 1.5151515151515151) internal successors, (1000), 671 states have internal predecessors, (1000), 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:20:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1000 transitions. [2024-10-11 21:20:21,036 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1000 transitions. Word has length 33 [2024-10-11 21:20:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,036 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1000 transitions. [2024-10-11 21:20:21,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:20:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1000 transitions. [2024-10-11 21:20:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 21:20:21,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:21,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:20:21,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1253823876, now seen corresponding path program 1 times [2024-10-11 21:20:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253178112] [2024-10-11 21:20:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,098 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:20:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253178112] [2024-10-11 21:20:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253178112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:21,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301239430] [2024-10-11 21:20:21,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:21,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:21,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:21,100 INFO L87 Difference]: Start difference. First operand 672 states and 1000 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:20:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,157 INFO L93 Difference]: Finished difference Result 1912 states and 2848 transitions. [2024-10-11 21:20:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 21:20:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,162 INFO L225 Difference]: With dead ends: 1912 [2024-10-11 21:20:21,162 INFO L226 Difference]: Without dead ends: 1260 [2024-10-11 21:20:21,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20:21,163 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 58 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 213 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-11 21:20:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1248. [2024-10-11 21:20:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1236 states have (on average 1.4983818770226538) internal successors, (1852), 1247 states have internal predecessors, (1852), 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:20:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1852 transitions. [2024-10-11 21:20:21,187 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1852 transitions. Word has length 35 [2024-10-11 21:20:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,188 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1852 transitions. [2024-10-11 21:20:21,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:20:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1852 transitions. [2024-10-11 21:20:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 21:20:21,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:20:21,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -573816696, now seen corresponding path program 1 times [2024-10-11 21:20:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954322335] [2024-10-11 21:20:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,221 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:20:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954322335] [2024-10-11 21:20:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954322335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:21,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519419279] [2024-10-11 21:20:21,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:21,222 INFO L87 Difference]: Start difference. First operand 1248 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:20:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,267 INFO L93 Difference]: Finished difference Result 3480 states and 5164 transitions. [2024-10-11 21:20:21,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:21,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-11 21:20:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,274 INFO L225 Difference]: With dead ends: 3480 [2024-10-11 21:20:21,274 INFO L226 Difference]: Without dead ends: 2252 [2024-10-11 21:20:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20:21,276 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:21,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2024-10-11 21:20:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2240. [2024-10-11 21:20:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 2228 states have (on average 1.481149012567325) internal successors, (3300), 2239 states have internal predecessors, (3300), 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:20:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3300 transitions. [2024-10-11 21:20:21,318 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3300 transitions. Word has length 35 [2024-10-11 21:20:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,318 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3300 transitions. [2024-10-11 21:20:21,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:20:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3300 transitions. [2024-10-11 21:20:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:20:21,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:21,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:20:21,320 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:21,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2129029084, now seen corresponding path program 1 times [2024-10-11 21:20:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414159473] [2024-10-11 21:20:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414159473] [2024-10-11 21:20:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414159473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586411593] [2024-10-11 21:20:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:20:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:20:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:20:21,366 INFO L87 Difference]: Start difference. First operand 2240 states and 3300 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,450 INFO L93 Difference]: Finished difference Result 5036 states and 7386 transitions. [2024-10-11 21:20:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:20:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 21:20:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,458 INFO L225 Difference]: With dead ends: 5036 [2024-10-11 21:20:21,458 INFO L226 Difference]: Without dead ends: 2816 [2024-10-11 21:20:21,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:20:21,461 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:20:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2024-10-11 21:20:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2770. [2024-10-11 21:20:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2758 states have (on average 1.4568527918781726) internal successors, (4018), 2769 states have internal predecessors, (4018), 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:20:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 4018 transitions. [2024-10-11 21:20:21,531 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 4018 transitions. Word has length 50 [2024-10-11 21:20:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,531 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 4018 transitions. [2024-10-11 21:20:21,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 4018 transitions. [2024-10-11 21:20:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:20:21,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:21,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:20:21,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:21,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2012057064, now seen corresponding path program 1 times [2024-10-11 21:20:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65554546] [2024-10-11 21:20:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65554546] [2024-10-11 21:20:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65554546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715115317] [2024-10-11 21:20:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:21,664 INFO L87 Difference]: Start difference. First operand 2770 states and 4018 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:20:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,805 INFO L93 Difference]: Finished difference Result 5524 states and 8014 transitions. [2024-10-11 21:20:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:21,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 21:20:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,812 INFO L225 Difference]: With dead ends: 5524 [2024-10-11 21:20:21,812 INFO L226 Difference]: Without dead ends: 2776 [2024-10-11 21:20:21,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:21,815 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 133 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 159 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2024-10-11 21:20:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2770. [2024-10-11 21:20:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2758 states have (on average 1.4452501812907905) internal successors, (3986), 2769 states have internal predecessors, (3986), 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:20:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3986 transitions. [2024-10-11 21:20:21,864 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3986 transitions. Word has length 54 [2024-10-11 21:20:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:21,865 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 3986 transitions. [2024-10-11 21:20:21,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:20:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3986 transitions. [2024-10-11 21:20:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 21:20:21,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:21,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:21,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 21:20:21,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1799307946, now seen corresponding path program 1 times [2024-10-11 21:20:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864456587] [2024-10-11 21:20:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:21,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864456587] [2024-10-11 21:20:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864456587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:21,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472294504] [2024-10-11 21:20:21,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:21,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:21,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:21,925 INFO L87 Difference]: Start difference. First operand 2770 states and 3986 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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:20:22,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:22,059 INFO L93 Difference]: Finished difference Result 3610 states and 5210 transitions. [2024-10-11 21:20:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 21:20:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:22,068 INFO L225 Difference]: With dead ends: 3610 [2024-10-11 21:20:22,069 INFO L226 Difference]: Without dead ends: 3607 [2024-10-11 21:20:22,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:22,070 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 95 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:22,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 208 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2024-10-11 21:20:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 2834. [2024-10-11 21:20:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2834 states, 2822 states have (on average 1.456413890857548) internal successors, (4110), 2833 states have internal predecessors, (4110), 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:20:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 4110 transitions. [2024-10-11 21:20:22,126 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 4110 transitions. Word has length 55 [2024-10-11 21:20:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:22,126 INFO L471 AbstractCegarLoop]: Abstraction has 2834 states and 4110 transitions. [2024-10-11 21:20:22,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 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:20:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 4110 transitions. [2024-10-11 21:20:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 21:20:22,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:22,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 21:20:22,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -56028281, now seen corresponding path program 1 times [2024-10-11 21:20:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114704443] [2024-10-11 21:20:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114704443] [2024-10-11 21:20:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114704443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:22,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:22,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558024892] [2024-10-11 21:20:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:22,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:22,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:22,201 INFO L87 Difference]: Start difference. First operand 2834 states and 4110 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:20:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:22,368 INFO L93 Difference]: Finished difference Result 7976 states and 11666 transitions. [2024-10-11 21:20:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 21:20:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:22,380 INFO L225 Difference]: With dead ends: 7976 [2024-10-11 21:20:22,380 INFO L226 Difference]: Without dead ends: 5164 [2024-10-11 21:20:22,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:22,384 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 239 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:22,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 205 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2024-10-11 21:20:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 4490. [2024-10-11 21:20:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4478 states have (on average 1.4635998213488164) internal successors, (6554), 4489 states have internal predecessors, (6554), 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:20:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 6554 transitions. [2024-10-11 21:20:22,493 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 6554 transitions. Word has length 56 [2024-10-11 21:20:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 4490 states and 6554 transitions. [2024-10-11 21:20:22,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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:20:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6554 transitions. [2024-10-11 21:20:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:20:22,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:22,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:22,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:20:22,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:22,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -848143028, now seen corresponding path program 1 times [2024-10-11 21:20:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:22,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597135262] [2024-10-11 21:20:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597135262] [2024-10-11 21:20:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597135262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:22,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:22,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893500904] [2024-10-11 21:20:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:22,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:22,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:22,568 INFO L87 Difference]: Start difference. First operand 4490 states and 6554 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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:20:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:22,726 INFO L93 Difference]: Finished difference Result 9345 states and 13558 transitions. [2024-10-11 21:20:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 21:20:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:22,738 INFO L225 Difference]: With dead ends: 9345 [2024-10-11 21:20:22,738 INFO L226 Difference]: Without dead ends: 4877 [2024-10-11 21:20:22,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:22,742 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 212 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:22,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 265 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2024-10-11 21:20:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 4490. [2024-10-11 21:20:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4478 states have (on average 1.4537740062527915) internal successors, (6510), 4489 states have internal predecessors, (6510), 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:20:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 6510 transitions. [2024-10-11 21:20:22,822 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 6510 transitions. Word has length 57 [2024-10-11 21:20:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:22,822 INFO L471 AbstractCegarLoop]: Abstraction has 4490 states and 6510 transitions. [2024-10-11 21:20:22,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 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:20:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 6510 transitions. [2024-10-11 21:20:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:20:22,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:22,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:22,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:20:22,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1736876468, now seen corresponding path program 1 times [2024-10-11 21:20:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460513656] [2024-10-11 21:20:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460513656] [2024-10-11 21:20:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460513656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:22,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117317107] [2024-10-11 21:20:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:22,921 INFO L87 Difference]: Start difference. First operand 4490 states and 6510 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:20:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:23,078 INFO L93 Difference]: Finished difference Result 8961 states and 13030 transitions. [2024-10-11 21:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 21:20:23,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:23,087 INFO L225 Difference]: With dead ends: 8961 [2024-10-11 21:20:23,087 INFO L226 Difference]: Without dead ends: 5257 [2024-10-11 21:20:23,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:23,092 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 206 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:23,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 277 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2024-10-11 21:20:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5254. [2024-10-11 21:20:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5242 states have (on average 1.4227394124380008) internal successors, (7458), 5253 states have internal predecessors, (7458), 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:20:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7458 transitions. [2024-10-11 21:20:23,184 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7458 transitions. Word has length 57 [2024-10-11 21:20:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 7458 transitions. [2024-10-11 21:20:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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:20:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7458 transitions. [2024-10-11 21:20:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 21:20:23,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:23,185 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:20:23,186 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash -754941862, now seen corresponding path program 1 times [2024-10-11 21:20:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158318916] [2024-10-11 21:20:23,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158318916] [2024-10-11 21:20:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158318916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:23,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498090763] [2024-10-11 21:20:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:23,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:23,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:23,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:23,263 INFO L87 Difference]: Start difference. First operand 5254 states and 7458 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:20:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:23,391 INFO L93 Difference]: Finished difference Result 5257 states and 7458 transitions. [2024-10-11 21:20:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 21:20:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:23,404 INFO L225 Difference]: With dead ends: 5257 [2024-10-11 21:20:23,404 INFO L226 Difference]: Without dead ends: 5254 [2024-10-11 21:20:23,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:23,406 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 106 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:23,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 155 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2024-10-11 21:20:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5251. [2024-10-11 21:20:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 5242 states have (on average 1.3952689813048456) internal successors, (7314), 5250 states have internal predecessors, (7314), 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:20:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 7314 transitions. [2024-10-11 21:20:23,535 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 7314 transitions. Word has length 57 [2024-10-11 21:20:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:23,536 INFO L471 AbstractCegarLoop]: Abstraction has 5251 states and 7314 transitions. [2024-10-11 21:20:23,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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:20:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 7314 transitions. [2024-10-11 21:20:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 21:20:23,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:23,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:23,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:20:23,537 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:23,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1928361003, now seen corresponding path program 1 times [2024-10-11 21:20:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554941546] [2024-10-11 21:20:23,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554941546] [2024-10-11 21:20:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554941546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193562268] [2024-10-11 21:20:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:23,595 INFO L87 Difference]: Start difference. First operand 5251 states and 7314 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:23,724 INFO L93 Difference]: Finished difference Result 6916 states and 9762 transitions. [2024-10-11 21:20:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 21:20:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:23,734 INFO L225 Difference]: With dead ends: 6916 [2024-10-11 21:20:23,735 INFO L226 Difference]: Without dead ends: 6913 [2024-10-11 21:20:23,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:23,737 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 86 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:23,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 203 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2024-10-11 21:20:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6907. [2024-10-11 21:20:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 6898 states have (on average 1.3943171933893883) internal successors, (9618), 6906 states have internal predecessors, (9618), 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:20:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 9618 transitions. [2024-10-11 21:20:23,883 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 9618 transitions. Word has length 58 [2024-10-11 21:20:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:23,883 INFO L471 AbstractCegarLoop]: Abstraction has 6907 states and 9618 transitions. [2024-10-11 21:20:23,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 9618 transitions. [2024-10-11 21:20:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:20:23,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:23,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:23,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:20:23,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 350351292, now seen corresponding path program 1 times [2024-10-11 21:20:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632473121] [2024-10-11 21:20:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632473121] [2024-10-11 21:20:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632473121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:23,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389944811] [2024-10-11 21:20:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:23,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:23,946 INFO L87 Difference]: Start difference. First operand 6907 states and 9618 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:24,140 INFO L93 Difference]: Finished difference Result 13107 states and 18738 transitions. [2024-10-11 21:20:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 21:20:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:24,152 INFO L225 Difference]: With dead ends: 13107 [2024-10-11 21:20:24,153 INFO L226 Difference]: Without dead ends: 8130 [2024-10-11 21:20:24,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:24,158 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 236 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:24,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 206 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2024-10-11 21:20:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 6735. [2024-10-11 21:20:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6735 states, 6726 states have (on average 1.4002378828427) internal successors, (9418), 6734 states have internal predecessors, (9418), 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:20:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6735 states to 6735 states and 9418 transitions. [2024-10-11 21:20:24,336 INFO L78 Accepts]: Start accepts. Automaton has 6735 states and 9418 transitions. Word has length 59 [2024-10-11 21:20:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 6735 states and 9418 transitions. [2024-10-11 21:20:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6735 states and 9418 transitions. [2024-10-11 21:20:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:24,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:24,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:24,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 21:20:24,338 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2024011593, now seen corresponding path program 1 times [2024-10-11 21:20:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338210150] [2024-10-11 21:20:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:24,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338210150] [2024-10-11 21:20:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338210150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:24,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:24,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437876806] [2024-10-11 21:20:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:24,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:24,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:24,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:24,400 INFO L87 Difference]: Start difference. First operand 6735 states and 9418 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:24,568 INFO L93 Difference]: Finished difference Result 11439 states and 16250 transitions. [2024-10-11 21:20:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 21:20:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:24,580 INFO L225 Difference]: With dead ends: 11439 [2024-10-11 21:20:24,580 INFO L226 Difference]: Without dead ends: 7014 [2024-10-11 21:20:24,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:24,586 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 200 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:24,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 282 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2024-10-11 21:20:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 7011. [2024-10-11 21:20:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7011 states, 7002 states have (on average 1.3953156241073978) internal successors, (9770), 7010 states have internal predecessors, (9770), 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:20:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7011 states to 7011 states and 9770 transitions. [2024-10-11 21:20:24,702 INFO L78 Accepts]: Start accepts. Automaton has 7011 states and 9770 transitions. Word has length 60 [2024-10-11 21:20:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:24,702 INFO L471 AbstractCegarLoop]: Abstraction has 7011 states and 9770 transitions. [2024-10-11 21:20:24,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7011 states and 9770 transitions. [2024-10-11 21:20:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 21:20:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:24,703 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:24,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 21:20:24,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -225085612, now seen corresponding path program 1 times [2024-10-11 21:20:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19803163] [2024-10-11 21:20:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19803163] [2024-10-11 21:20:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19803163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866351571] [2024-10-11 21:20:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:24,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:24,839 INFO L87 Difference]: Start difference. First operand 7011 states and 9770 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:25,186 INFO L93 Difference]: Finished difference Result 7397 states and 10290 transitions. [2024-10-11 21:20:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 21:20:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:25,207 INFO L225 Difference]: With dead ends: 7397 [2024-10-11 21:20:25,208 INFO L226 Difference]: Without dead ends: 7394 [2024-10-11 21:20:25,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:25,210 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:25,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:20:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2024-10-11 21:20:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 7391. [2024-10-11 21:20:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7391 states, 7382 states have (on average 1.385261446762395) internal successors, (10226), 7390 states have internal predecessors, (10226), 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:20:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 10226 transitions. [2024-10-11 21:20:25,318 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 10226 transitions. Word has length 61 [2024-10-11 21:20:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 7391 states and 10226 transitions. [2024-10-11 21:20:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 10226 transitions. [2024-10-11 21:20:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 21:20:25,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:25,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:25,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 21:20:25,320 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -170722723, now seen corresponding path program 1 times [2024-10-11 21:20:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821443680] [2024-10-11 21:20:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821443680] [2024-10-11 21:20:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821443680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441485550] [2024-10-11 21:20:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:25,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:25,378 INFO L87 Difference]: Start difference. First operand 7391 states and 10226 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:25,577 INFO L93 Difference]: Finished difference Result 9611 states and 13490 transitions. [2024-10-11 21:20:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-11 21:20:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:25,592 INFO L225 Difference]: With dead ends: 9611 [2024-10-11 21:20:25,592 INFO L226 Difference]: Without dead ends: 9608 [2024-10-11 21:20:25,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:25,595 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 125 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:25,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 254 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:25,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2024-10-11 21:20:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 9047. [2024-10-11 21:20:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9047 states, 9038 states have (on average 1.3704359371542376) internal successors, (12386), 9046 states have internal predecessors, (12386), 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:20:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 12386 transitions. [2024-10-11 21:20:25,789 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 12386 transitions. Word has length 62 [2024-10-11 21:20:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:25,789 INFO L471 AbstractCegarLoop]: Abstraction has 9047 states and 12386 transitions. [2024-10-11 21:20:25,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 12386 transitions. [2024-10-11 21:20:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 21:20:25,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:25,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:25,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 21:20:25,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash -997436876, now seen corresponding path program 1 times [2024-10-11 21:20:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808686755] [2024-10-11 21:20:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808686755] [2024-10-11 21:20:25,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808686755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:25,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:25,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:25,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752711892] [2024-10-11 21:20:25,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:25,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:25,871 INFO L87 Difference]: Start difference. First operand 9047 states and 12386 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,011 INFO L93 Difference]: Finished difference Result 11001 states and 15082 transitions. [2024-10-11 21:20:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:26,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-11 21:20:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,020 INFO L225 Difference]: With dead ends: 11001 [2024-10-11 21:20:26,020 INFO L226 Difference]: Without dead ends: 7131 [2024-10-11 21:20:26,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,024 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 237 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7131 states. [2024-10-11 21:20:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7131 to 5363. [2024-10-11 21:20:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5363 states, 5354 states have (on average 1.3556219648860666) internal successors, (7258), 5362 states have internal predecessors, (7258), 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:20:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5363 states to 5363 states and 7258 transitions. [2024-10-11 21:20:26,155 INFO L78 Accepts]: Start accepts. Automaton has 5363 states and 7258 transitions. Word has length 63 [2024-10-11 21:20:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 5363 states and 7258 transitions. [2024-10-11 21:20:26,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:20:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5363 states and 7258 transitions. [2024-10-11 21:20:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 21:20:26,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:26,156 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:26,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 21:20:26,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 32961599, now seen corresponding path program 1 times [2024-10-11 21:20:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688287661] [2024-10-11 21:20:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688287661] [2024-10-11 21:20:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688287661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594594865] [2024-10-11 21:20:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:26,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,216 INFO L87 Difference]: Start difference. First operand 5363 states and 7258 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:20:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,348 INFO L93 Difference]: Finished difference Result 5645 states and 7642 transitions. [2024-10-11 21:20:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:26,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 21:20:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,355 INFO L225 Difference]: With dead ends: 5645 [2024-10-11 21:20:26,355 INFO L226 Difference]: Without dead ends: 5642 [2024-10-11 21:20:26,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,356 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 143 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 279 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2024-10-11 21:20:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5639. [2024-10-11 21:20:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5639 states, 5630 states have (on average 1.353108348134991) internal successors, (7618), 5638 states have internal predecessors, (7618), 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:20:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7618 transitions. [2024-10-11 21:20:26,426 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7618 transitions. Word has length 64 [2024-10-11 21:20:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:26,426 INFO L471 AbstractCegarLoop]: Abstraction has 5639 states and 7618 transitions. [2024-10-11 21:20:26,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:20:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7618 transitions. [2024-10-11 21:20:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 21:20:26,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:26,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:26,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 21:20:26,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -855771841, now seen corresponding path program 1 times [2024-10-11 21:20:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:26,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780269095] [2024-10-11 21:20:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:26,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780269095] [2024-10-11 21:20:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780269095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116018042] [2024-10-11 21:20:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:26,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,495 INFO L87 Difference]: Start difference. First operand 5639 states and 7618 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:20:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,625 INFO L93 Difference]: Finished difference Result 6657 states and 9082 transitions. [2024-10-11 21:20:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-11 21:20:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,633 INFO L225 Difference]: With dead ends: 6657 [2024-10-11 21:20:26,633 INFO L226 Difference]: Without dead ends: 6656 [2024-10-11 21:20:26,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,635 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 294 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2024-10-11 21:20:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6647. [2024-10-11 21:20:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6647 states, 6638 states have (on average 1.3669780054233203) internal successors, (9074), 6646 states have internal predecessors, (9074), 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:20:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6647 states to 6647 states and 9074 transitions. [2024-10-11 21:20:26,761 INFO L78 Accepts]: Start accepts. Automaton has 6647 states and 9074 transitions. Word has length 64 [2024-10-11 21:20:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 6647 states and 9074 transitions. [2024-10-11 21:20:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 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:20:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6647 states and 9074 transitions. [2024-10-11 21:20:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:20:26,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:26,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:26,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 21:20:26,763 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:26,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1807786809, now seen corresponding path program 1 times [2024-10-11 21:20:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17844645] [2024-10-11 21:20:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:26,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17844645] [2024-10-11 21:20:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17844645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303450511] [2024-10-11 21:20:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:26,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,828 INFO L87 Difference]: Start difference. First operand 6647 states and 9074 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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:20:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:26,970 INFO L93 Difference]: Finished difference Result 6832 states and 9314 transitions. [2024-10-11 21:20:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:26,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-11 21:20:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:26,976 INFO L225 Difference]: With dead ends: 6832 [2024-10-11 21:20:26,976 INFO L226 Difference]: Without dead ends: 6471 [2024-10-11 21:20:26,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:26,979 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 133 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:26,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 378 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2024-10-11 21:20:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 6467. [2024-10-11 21:20:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6467 states, 6458 states have (on average 1.3660576029730567) internal successors, (8822), 6466 states have internal predecessors, (8822), 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:20:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6467 states to 6467 states and 8822 transitions. [2024-10-11 21:20:27,080 INFO L78 Accepts]: Start accepts. Automaton has 6467 states and 8822 transitions. Word has length 68 [2024-10-11 21:20:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:27,080 INFO L471 AbstractCegarLoop]: Abstraction has 6467 states and 8822 transitions. [2024-10-11 21:20:27,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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:20:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6467 states and 8822 transitions. [2024-10-11 21:20:27,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:20:27,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:27,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 21:20:27,083 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -445356341, now seen corresponding path program 1 times [2024-10-11 21:20:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254442279] [2024-10-11 21:20:27,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254442279] [2024-10-11 21:20:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254442279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:20:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411635630] [2024-10-11 21:20:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:27,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:20:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:20:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:27,143 INFO L87 Difference]: Start difference. First operand 6467 states and 8822 transitions. Second operand has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 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:20:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:27,293 INFO L93 Difference]: Finished difference Result 6653 states and 9058 transitions. [2024-10-11 21:20:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:20:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-11 21:20:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:27,302 INFO L225 Difference]: With dead ends: 6653 [2024-10-11 21:20:27,302 INFO L226 Difference]: Without dead ends: 6650 [2024-10-11 21:20:27,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:20:27,305 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 94 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:27,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 309 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2024-10-11 21:20:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6464. [2024-10-11 21:20:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 6458 states have (on average 1.328894394549396) internal successors, (8582), 6463 states have internal predecessors, (8582), 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:20:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 8582 transitions. [2024-10-11 21:20:27,420 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 8582 transitions. Word has length 81 [2024-10-11 21:20:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:27,420 INFO L471 AbstractCegarLoop]: Abstraction has 6464 states and 8582 transitions. [2024-10-11 21:20:27,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.0) internal successors, (78), 4 states have internal predecessors, (78), 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:20:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 8582 transitions. [2024-10-11 21:20:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 21:20:27,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:27,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:27,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 21:20:27,422 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1574871758, now seen corresponding path program 1 times [2024-10-11 21:20:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092661798] [2024-10-11 21:20:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092661798] [2024-10-11 21:20:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092661798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767710563] [2024-10-11 21:20:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:27,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:27,510 INFO L87 Difference]: Start difference. First operand 6464 states and 8582 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:20:27,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:27,676 INFO L93 Difference]: Finished difference Result 6847 states and 9070 transitions. [2024-10-11 21:20:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:27,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 21:20:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:27,683 INFO L225 Difference]: With dead ends: 6847 [2024-10-11 21:20:27,683 INFO L226 Difference]: Without dead ends: 6844 [2024-10-11 21:20:27,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:27,685 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 116 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:27,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 283 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2024-10-11 21:20:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 6084. [2024-10-11 21:20:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6084 states, 6078 states have (on average 1.326423165514972) internal successors, (8062), 6083 states have internal predecessors, (8062), 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:20:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 8062 transitions. [2024-10-11 21:20:27,763 INFO L78 Accepts]: Start accepts. Automaton has 6084 states and 8062 transitions. Word has length 82 [2024-10-11 21:20:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:27,763 INFO L471 AbstractCegarLoop]: Abstraction has 6084 states and 8062 transitions. [2024-10-11 21:20:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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:20:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 6084 states and 8062 transitions. [2024-10-11 21:20:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 21:20:27,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:27,765 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:27,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 21:20:27,765 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:27,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1509293613, now seen corresponding path program 1 times [2024-10-11 21:20:27,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126377189] [2024-10-11 21:20:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:27,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:27,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126377189] [2024-10-11 21:20:27,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126377189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:27,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:27,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:27,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778056836] [2024-10-11 21:20:27,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:27,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:27,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:27,839 INFO L87 Difference]: Start difference. First operand 6084 states and 8062 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:20:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:28,037 INFO L93 Difference]: Finished difference Result 9303 states and 12434 transitions. [2024-10-11 21:20:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:28,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 21:20:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:28,043 INFO L225 Difference]: With dead ends: 9303 [2024-10-11 21:20:28,043 INFO L226 Difference]: Without dead ends: 5617 [2024-10-11 21:20:28,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,046 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:28,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 362 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5617 states. [2024-10-11 21:20:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5617 to 5608. [2024-10-11 21:20:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5608 states, 5602 states have (on average 1.320599785790789) internal successors, (7398), 5607 states have internal predecessors, (7398), 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:20:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5608 states to 5608 states and 7398 transitions. [2024-10-11 21:20:28,157 INFO L78 Accepts]: Start accepts. Automaton has 5608 states and 7398 transitions. Word has length 83 [2024-10-11 21:20:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,158 INFO L471 AbstractCegarLoop]: Abstraction has 5608 states and 7398 transitions. [2024-10-11 21:20:28,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:20:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5608 states and 7398 transitions. [2024-10-11 21:20:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 21:20:28,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,160 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:28,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 21:20:28,161 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:28,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -409527861, now seen corresponding path program 2 times [2024-10-11 21:20:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783970604] [2024-10-11 21:20:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 21:20:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:28,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783970604] [2024-10-11 21:20:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783970604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:28,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568624460] [2024-10-11 21:20:28,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:28,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,255 INFO L87 Difference]: Start difference. First operand 5608 states and 7398 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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:20:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:28,421 INFO L93 Difference]: Finished difference Result 5795 states and 7634 transitions. [2024-10-11 21:20:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-10-11 21:20:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:28,426 INFO L225 Difference]: With dead ends: 5795 [2024-10-11 21:20:28,426 INFO L226 Difference]: Without dead ends: 4882 [2024-10-11 21:20:28,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,428 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 137 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:28,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 370 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2024-10-11 21:20:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4876. [2024-10-11 21:20:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4870 states have (on average 1.321971252566735) internal successors, (6438), 4875 states have internal predecessors, (6438), 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:20:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 6438 transitions. [2024-10-11 21:20:28,527 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 6438 transitions. Word has length 83 [2024-10-11 21:20:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,527 INFO L471 AbstractCegarLoop]: Abstraction has 4876 states and 6438 transitions. [2024-10-11 21:20:28,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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:20:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 6438 transitions. [2024-10-11 21:20:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 21:20:28,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:28,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 21:20:28,529 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:28,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1373230046, now seen corresponding path program 1 times [2024-10-11 21:20:28,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:28,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067015850] [2024-10-11 21:20:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067015850] [2024-10-11 21:20:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067015850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534588485] [2024-10-11 21:20:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:28,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,622 INFO L87 Difference]: Start difference. First operand 4876 states and 6438 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:20:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:28,735 INFO L93 Difference]: Finished difference Result 5929 states and 7856 transitions. [2024-10-11 21:20:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 21:20:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:28,739 INFO L225 Difference]: With dead ends: 5929 [2024-10-11 21:20:28,739 INFO L226 Difference]: Without dead ends: 3259 [2024-10-11 21:20:28,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,743 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 102 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:28,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 245 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2024-10-11 21:20:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 2929. [2024-10-11 21:20:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2926 states have (on average 1.273410799726589) internal successors, (3726), 2928 states have internal predecessors, (3726), 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:20:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 3726 transitions. [2024-10-11 21:20:28,808 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 3726 transitions. Word has length 84 [2024-10-11 21:20:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,809 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 3726 transitions. [2024-10-11 21:20:28,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:20:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 3726 transitions. [2024-10-11 21:20:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:20:28,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,811 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:28,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 21:20:28,813 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:28,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1010030609, now seen corresponding path program 1 times [2024-10-11 21:20:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801221806] [2024-10-11 21:20:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801221806] [2024-10-11 21:20:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801221806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244201365] [2024-10-11 21:20:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,963 INFO L87 Difference]: Start difference. First operand 2929 states and 3726 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:20:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,084 INFO L93 Difference]: Finished difference Result 2930 states and 3726 transitions. [2024-10-11 21:20:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 21:20:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,088 INFO L225 Difference]: With dead ends: 2930 [2024-10-11 21:20:29,088 INFO L226 Difference]: Without dead ends: 2927 [2024-10-11 21:20:29,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,089 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 110 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 326 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2024-10-11 21:20:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2927. [2024-10-11 21:20:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2926 states have (on average 1.2652084757347914) internal successors, (3702), 2926 states have internal predecessors, (3702), 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:20:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3702 transitions. [2024-10-11 21:20:29,129 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3702 transitions. Word has length 85 [2024-10-11 21:20:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,129 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3702 transitions. [2024-10-11 21:20:29,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:20:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3702 transitions. [2024-10-11 21:20:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:20:29,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:29,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 21:20:29,132 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 379541777, now seen corresponding path program 1 times [2024-10-11 21:20:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058057162] [2024-10-11 21:20:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:29,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058057162] [2024-10-11 21:20:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058057162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995912162] [2024-10-11 21:20:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:29,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,214 INFO L87 Difference]: Start difference. First operand 2927 states and 3702 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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:20:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,326 INFO L93 Difference]: Finished difference Result 2928 states and 3702 transitions. [2024-10-11 21:20:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:29,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 21:20:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,329 INFO L225 Difference]: With dead ends: 2928 [2024-10-11 21:20:29,329 INFO L226 Difference]: Without dead ends: 2927 [2024-10-11 21:20:29,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,331 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 91 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 294 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2024-10-11 21:20:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2927. [2024-10-11 21:20:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2926 states have (on average 1.2624743677375256) internal successors, (3694), 2926 states have internal predecessors, (3694), 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:20:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3694 transitions. [2024-10-11 21:20:29,373 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3694 transitions. Word has length 85 [2024-10-11 21:20:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 3694 transitions. [2024-10-11 21:20:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 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:20:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3694 transitions. [2024-10-11 21:20:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 21:20:29,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:29,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:29,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 21:20:29,377 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:29,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1471510631, now seen corresponding path program 1 times [2024-10-11 21:20:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504251607] [2024-10-11 21:20:29,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504251607] [2024-10-11 21:20:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504251607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407634604] [2024-10-11 21:20:29,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:29,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:29,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:29,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,452 INFO L87 Difference]: Start difference. First operand 2927 states and 3694 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:20:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,558 INFO L93 Difference]: Finished difference Result 3109 states and 3926 transitions. [2024-10-11 21:20:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 21:20:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,561 INFO L225 Difference]: With dead ends: 3109 [2024-10-11 21:20:29,561 INFO L226 Difference]: Without dead ends: 2652 [2024-10-11 21:20:29,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,562 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 121 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 392 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2024-10-11 21:20:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2471. [2024-10-11 21:20:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2470 states have (on average 1.2510121457489878) internal successors, (3090), 2470 states have internal predecessors, (3090), 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:20:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3090 transitions. [2024-10-11 21:20:29,597 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3090 transitions. Word has length 89 [2024-10-11 21:20:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,598 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3090 transitions. [2024-10-11 21:20:29,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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:20:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3090 transitions. [2024-10-11 21:20:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 21:20:29,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:29,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 21:20:29,600 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1543075943, now seen corresponding path program 2 times [2024-10-11 21:20:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831628346] [2024-10-11 21:20:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:29,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831628346] [2024-10-11 21:20:29,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831628346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:29,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:29,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:29,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148111265] [2024-10-11 21:20:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:29,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:29,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,680 INFO L87 Difference]: Start difference. First operand 2471 states and 3090 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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:20:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,761 INFO L93 Difference]: Finished difference Result 2472 states and 3090 transitions. [2024-10-11 21:20:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:29,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-11 21:20:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,764 INFO L225 Difference]: With dead ends: 2472 [2024-10-11 21:20:29,764 INFO L226 Difference]: Without dead ends: 1731 [2024-10-11 21:20:29,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,765 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 100 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 369 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2024-10-11 21:20:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2024-10-11 21:20:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 1.2427745664739884) internal successors, (2150), 1730 states have internal predecessors, (2150), 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:20:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2150 transitions. [2024-10-11 21:20:29,790 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2150 transitions. Word has length 89 [2024-10-11 21:20:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2150 transitions. [2024-10-11 21:20:29,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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:20:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2150 transitions. [2024-10-11 21:20:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 21:20:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:29,793 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 21:20:29,793 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-10-11 21:20:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1269102197, now seen corresponding path program 1 times [2024-10-11 21:20:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170298541] [2024-10-11 21:20:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:20:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170298541] [2024-10-11 21:20:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170298541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753804165] [2024-10-11 21:20:29,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:29,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:29,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,881 INFO L87 Difference]: Start difference. First operand 1731 states and 2150 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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:20:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:29,960 INFO L93 Difference]: Finished difference Result 1731 states and 2150 transitions. [2024-10-11 21:20:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:20:29,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-11 21:20:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:29,961 INFO L225 Difference]: With dead ends: 1731 [2024-10-11 21:20:29,961 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:20:29,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:29,962 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 102 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:29,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:20:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:20:29,964 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:20:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:20:29,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2024-10-11 21:20:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:29,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:20:29,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 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:20:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:20:29,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:20:29,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2024-10-11 21:20:29,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2024-10-11 21:20:29,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2024-10-11 21:20:29,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2024-10-11 21:20:29,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2024-10-11 21:20:29,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 21:20:29,972 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:29,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:20:33,633 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:20:33,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:20:33 BoogieIcfgContainer [2024-10-11 21:20:33,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:20:33,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:20:33,648 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:20:33,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:20:33,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:20:19" (3/4) ... [2024-10-11 21:20:33,650 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:20:33,661 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-11 21:20:33,665 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 21:20:33,666 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:20:33,666 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:20:33,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:20:33,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:20:33,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:20:33,773 INFO L158 Benchmark]: Toolchain (without parser) took 15254.00ms. Allocated memory was 213.9MB in the beginning and 1.1GB in the end (delta: 859.8MB). Free memory was 143.7MB in the beginning and 570.7MB in the end (delta: -427.1MB). Peak memory consumption was 434.3MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,773 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:20:33,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.76ms. Allocated memory is still 213.9MB. Free memory was 143.4MB in the beginning and 128.6MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.46ms. Allocated memory is still 213.9MB. Free memory was 128.6MB in the beginning and 126.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,774 INFO L158 Benchmark]: Boogie Preprocessor took 73.38ms. Allocated memory is still 213.9MB. Free memory was 126.2MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,774 INFO L158 Benchmark]: RCFGBuilder took 502.95ms. Allocated memory is still 213.9MB. Free memory was 123.6MB in the beginning and 160.0MB in the end (delta: -36.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,774 INFO L158 Benchmark]: TraceAbstraction took 14214.28ms. Allocated memory was 213.9MB in the beginning and 1.1GB in the end (delta: 859.8MB). Free memory was 160.0MB in the beginning and 578.1MB in the end (delta: -418.0MB). Peak memory consumption was 641.9MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,775 INFO L158 Benchmark]: Witness Printer took 125.10ms. Allocated memory is still 1.1GB. Free memory was 578.1MB in the beginning and 570.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 21:20:33,776 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.15ms. Allocated memory is still 109.1MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.76ms. Allocated memory is still 213.9MB. Free memory was 143.4MB in the beginning and 128.6MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.46ms. Allocated memory is still 213.9MB. Free memory was 128.6MB in the beginning and 126.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.38ms. Allocated memory is still 213.9MB. Free memory was 126.2MB in the beginning and 123.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.95ms. Allocated memory is still 213.9MB. Free memory was 123.6MB in the beginning and 160.0MB in the end (delta: -36.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14214.28ms. Allocated memory was 213.9MB in the beginning and 1.1GB in the end (delta: 859.8MB). Free memory was 160.0MB in the beginning and 578.1MB in the end (delta: -418.0MB). Peak memory consumption was 641.9MB. Max. memory is 16.1GB. * Witness Printer took 125.10ms. Allocated memory is still 1.1GB. Free memory was 578.1MB in the beginning and 570.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 208]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 217]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4985 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4985 mSDsluCounter, 8930 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4487 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3676 IncrementalHoareTripleChecker+Invalid, 3840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 4443 mSDtfsCounter, 3676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9047occurred in iteration=21, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 7374 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2053 NumberOfCodeBlocks, 2053 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2018 ConstructedInterpolants, 0 QuantifiedInterpolants, 7923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 607/607 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 14 specifications checked. All of them hold - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((((((st1 == 1) && (st2 == 1)) && (st3 == 1)) || (((st1 == 1) && (st3 == 1)) && (st2 == 0))) || (((st3 == 1) && (st1 == 0)) && (st2 == 0))) || (((st3 == 0) && (st1 == 0)) && (st2 == 0))) || (((st1 == 1) && (st3 == 0)) && (st2 == 0))) || (((st2 == 1) && (st3 == 1)) && (st1 == 0))) || (((st1 == 1) && (st2 == 1)) && (st3 == 0))) || (((st2 == 1) && (st3 == 0)) && (st1 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:20:33,811 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