./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/aviad.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/aviad.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 212c9b1b6a93f8f17548e7937584929a6b6ed1677eb6287f5deae898fbaeb3a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:45:24,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:45:24,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 01:45:24,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:45:24,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:45:24,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:45:24,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:45:24,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:45:24,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:45:24,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:45:24,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:45:24,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:45:24,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:45:24,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:45:24,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:45:24,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:24,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:45:24,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:45:24,201 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 212c9b1b6a93f8f17548e7937584929a6b6ed1677eb6287f5deae898fbaeb3a4 [2025-03-09 01:45:24,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:45:24,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:45:24,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:45:24,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:45:24,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:45:24,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/aviad.c [2025-03-09 01:45:25,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce46b6fda/d16c8ea07a10466c85d2197c3e002bfc/FLAG5f7ba7dbc [2025-03-09 01:45:25,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:45:25,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/aviad.c [2025-03-09 01:45:25,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce46b6fda/d16c8ea07a10466c85d2197c3e002bfc/FLAG5f7ba7dbc [2025-03-09 01:45:26,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce46b6fda/d16c8ea07a10466c85d2197c3e002bfc [2025-03-09 01:45:26,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:45:26,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:45:26,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:26,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:45:26,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:45:26,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f833fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26, skipping insertion in model container [2025-03-09 01:45:26,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:45:26,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:26,280 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:45:26,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:45:26,303 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:45:26,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26 WrapperNode [2025-03-09 01:45:26,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:45:26,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:26,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:45:26,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:45:26,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,321 INFO L138 Inliner]: procedures = 5, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2025-03-09 01:45:26,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:45:26,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:45:26,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:45:26,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:45:26,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,337 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 01:45:26,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:45:26,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:45:26,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:45:26,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:45:26,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (1/1) ... [2025-03-09 01:45:26,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:45:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:26,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:45:26,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:45:26,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:45:26,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:45:26,551 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-09 01:45:26,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:45:26,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:45:26,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:45:26,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:26 BoogieIcfgContainer [2025-03-09 01:45:26,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:45:26,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:45:26,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:45:26,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:45:26,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:45:26" (1/3) ... [2025-03-09 01:45:26,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5946cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:26, skipping insertion in model container [2025-03-09 01:45:26,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:45:26" (2/3) ... [2025-03-09 01:45:26,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5946cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:45:26, skipping insertion in model container [2025-03-09 01:45:26,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:45:26" (3/3) ... [2025-03-09 01:45:26,570 INFO L128 eAbstractionObserver]: Analyzing ICFG aviad.c [2025-03-09 01:45:26,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:45:26,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aviad.c that has 1 procedures, 21 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 01:45:26,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:45:26,630 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;@52615801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:45:26,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:45:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 20 states have internal predecessors, (22), 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) [2025-03-09 01:45:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:45:26,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:26,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:45:26,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash 49592015, now seen corresponding path program 1 times [2025-03-09 01:45:26,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634636145] [2025-03-09 01:45:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:26,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:45:26,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:45:26,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:26,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634636145] [2025-03-09 01:45:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634636145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:26,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:26,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:26,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099695084] [2025-03-09 01:45:26,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:26,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:27,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,009 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-09 01:45:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,059 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2025-03-09 01:45:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:27,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-09 01:45:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,068 INFO L225 Difference]: With dead ends: 21 [2025-03-09 01:45:27,068 INFO L226 Difference]: Without dead ends: 16 [2025-03-09 01:45:27,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,076 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-09 01:45:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 01:45:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 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) [2025-03-09 01:45:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-03-09 01:45:27,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 5 [2025-03-09 01:45:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,100 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-09 01:45:27,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-09 01:45:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-03-09 01:45:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:45:27,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:45:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:45:27,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash 49592050, now seen corresponding path program 1 times [2025-03-09 01:45:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177592255] [2025-03-09 01:45:27,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:45:27,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:45:27,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177592255] [2025-03-09 01:45:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177592255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:45:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778286721] [2025-03-09 01:45:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:45:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:45:27,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:27,135 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-09 01:45:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,151 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-09 01:45:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:45:27,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 01:45:27,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,152 INFO L225 Difference]: With dead ends: 16 [2025-03-09 01:45:27,152 INFO L226 Difference]: Without dead ends: 15 [2025-03-09 01:45:27,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:27,153 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-09 01:45:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 01:45:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 14 states have internal predecessors, (16), 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) [2025-03-09 01:45:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-09 01:45:27,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 5 [2025-03-09 01:45:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,159 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-09 01:45:27,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2025-03-09 01:45:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-09 01:45:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:45:27,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:45:27,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:45:27,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1537352445, now seen corresponding path program 1 times [2025-03-09 01:45:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768796526] [2025-03-09 01:45:27,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:45:27,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:45:27,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768796526] [2025-03-09 01:45:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768796526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:27,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:45:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686292925] [2025-03-09 01:45:27,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:45:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:45:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:45:27,400 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,422 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-03-09 01:45:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:45:27,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:45:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,423 INFO L225 Difference]: With dead ends: 15 [2025-03-09 01:45:27,423 INFO L226 Difference]: Without dead ends: 14 [2025-03-09 01:45:27,423 INFO L434 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 [2025-03-09 01:45:27,424 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-09 01:45:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-09 01:45:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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) [2025-03-09 01:45:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-09 01:45:27,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 6 [2025-03-09 01:45:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,426 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-09 01:45:27,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-09 01:45:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 01:45:27,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:45:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:45:27,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1537353534, now seen corresponding path program 1 times [2025-03-09 01:45:27,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924255104] [2025-03-09 01:45:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:45:27,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:45:27,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924255104] [2025-03-09 01:45:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924255104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:27,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:45:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046602123] [2025-03-09 01:45:27,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:45:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:45:27,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:27,454 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,465 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2025-03-09 01:45:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:45:27,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 01:45:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,467 INFO L225 Difference]: With dead ends: 14 [2025-03-09 01:45:27,467 INFO L226 Difference]: Without dead ends: 13 [2025-03-09 01:45:27,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:45:27,467 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-09 01:45:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-09 01:45:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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) [2025-03-09 01:45:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-09 01:45:27,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 6 [2025-03-09 01:45:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,471 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-09 01:45:27,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:45:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-09 01:45:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:45:27,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:27,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:45:27,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -73050853, now seen corresponding path program 1 times [2025-03-09 01:45:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559031429] [2025-03-09 01:45:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:45:27,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:45:27,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559031429] [2025-03-09 01:45:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559031429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:27,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:27,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249512893] [2025-03-09 01:45:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:27,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,506 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 01:45:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,514 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2025-03-09 01:45:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-09 01:45:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,515 INFO L225 Difference]: With dead ends: 13 [2025-03-09 01:45:27,515 INFO L226 Difference]: Without dead ends: 12 [2025-03-09 01:45:27,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,516 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-09 01:45:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-09 01:45:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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) [2025-03-09 01:45:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-03-09 01:45:27,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2025-03-09 01:45:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,517 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-03-09 01:45:27,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2025-03-09 01:45:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-03-09 01:45:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:45:27,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:45:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:45:27,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2030390828, now seen corresponding path program 1 times [2025-03-09 01:45:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165860862] [2025-03-09 01:45:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:45:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:45:27,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165860862] [2025-03-09 01:45:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165860862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:45:27,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:45:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:45:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894929751] [2025-03-09 01:45:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:45:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:45:27,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,552 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2025-03-09 01:45:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,565 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-03-09 01:45:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:45:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 [2025-03-09 01:45:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,565 INFO L225 Difference]: With dead ends: 22 [2025-03-09 01:45:27,565 INFO L226 Difference]: Without dead ends: 21 [2025-03-09 01:45:27,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:45:27,566 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-09 01:45:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-09 01:45:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2025-03-09 01:45:27,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-03-09 01:45:27,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2025-03-09 01:45:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,569 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-03-09 01:45:27,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2025-03-09 01:45:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-03-09 01:45:27,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:45:27,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:45:27,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:45:27,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1757732831, now seen corresponding path program 1 times [2025-03-09 01:45:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472121055] [2025-03-09 01:45:27,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:45:27,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:45:27,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472121055] [2025-03-09 01:45:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472121055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:27,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625977293] [2025-03-09 01:45:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:27,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:27,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:27,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:27,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:45:27,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:45:27,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:45:27,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:27,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:27,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:45:27,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625977293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:27,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:45:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856265988] [2025-03-09 01:45:27,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:45:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:27,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:45:27,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:27,753 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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) [2025-03-09 01:45:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:27,776 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-09 01:45:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:45:27,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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 16 [2025-03-09 01:45:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:27,777 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:45:27,777 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:45:27,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:45:27,779 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:27,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:45:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 01:45:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 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) [2025-03-09 01:45:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 01:45:27,784 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2025-03-09 01:45:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:27,785 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 01:45:27,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 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) [2025-03-09 01:45:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 01:45:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 01:45:27,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:27,786 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1] [2025-03-09 01:45:27,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:45:27,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:27,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:27,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash 838552300, now seen corresponding path program 2 times [2025-03-09 01:45:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:27,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774438883] [2025-03-09 01:45:27,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:27,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:45:28,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:45:28,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:28,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774438883] [2025-03-09 01:45:28,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774438883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:28,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991676002] [2025-03-09 01:45:28,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:45:28,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:28,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:28,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:28,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:45:28,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:45:28,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:45:28,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:45:28,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:28,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:45:28,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:28,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991676002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:28,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-09 01:45:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034619331] [2025-03-09 01:45:28,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:28,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:45:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:28,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:45:28,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:45:28,420 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 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) [2025-03-09 01:45:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:28,473 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2025-03-09 01:45:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:45:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 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 37 [2025-03-09 01:45:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:28,474 INFO L225 Difference]: With dead ends: 103 [2025-03-09 01:45:28,474 INFO L226 Difference]: Without dead ends: 102 [2025-03-09 01:45:28,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:45:28,475 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:28,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 106 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:45:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-09 01:45:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-09 01:45:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.118811881188119) internal successors, (113), 101 states have internal predecessors, (113), 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) [2025-03-09 01:45:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2025-03-09 01:45:28,484 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 37 [2025-03-09 01:45:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:28,485 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2025-03-09 01:45:28,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 22 states have internal predecessors, (73), 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) [2025-03-09 01:45:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2025-03-09 01:45:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-09 01:45:28,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:28,487 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1] [2025-03-09 01:45:28,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 01:45:28,688 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 498260492, now seen corresponding path program 3 times [2025-03-09 01:45:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:28,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-03-09 01:45:28,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:28,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-09 01:45:28,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 01:45:28,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:45:28,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272643336] [2025-03-09 01:45:29,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272643336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274594535] [2025-03-09 01:45:29,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:45:29,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:29,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:29,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:45:29,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 11 equivalence classes. [2025-03-09 01:45:29,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 79 of 79 statements. [2025-03-09 01:45:29,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 01:45:29,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:29,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:45:29,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:29,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274594535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:30,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-09 01:45:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731688104] [2025-03-09 01:45:30,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 01:45:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 01:45:30,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:45:30,124 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 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) [2025-03-09 01:45:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:30,241 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2025-03-09 01:45:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 01:45:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 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 79 [2025-03-09 01:45:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:30,243 INFO L225 Difference]: With dead ends: 211 [2025-03-09 01:45:30,244 INFO L226 Difference]: Without dead ends: 210 [2025-03-09 01:45:30,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 01:45:30,245 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 249 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:30,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 194 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:45:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-09 01:45:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-03-09 01:45:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.1148325358851674) internal successors, (233), 209 states have internal predecessors, (233), 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) [2025-03-09 01:45:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 233 transitions. [2025-03-09 01:45:30,263 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 233 transitions. Word has length 79 [2025-03-09 01:45:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:30,263 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 233 transitions. [2025-03-09 01:45:30,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.488888888888889) internal successors, (157), 46 states have internal predecessors, (157), 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) [2025-03-09 01:45:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 233 transitions. [2025-03-09 01:45:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-09 01:45:30,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:30,267 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1] [2025-03-09 01:45:30,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:45:30,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:30,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:30,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1789214796, now seen corresponding path program 4 times [2025-03-09 01:45:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:30,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349050657] [2025-03-09 01:45:30,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:45:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:30,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-03-09 01:45:30,545 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 01:45:30,545 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:45:30,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349050657] [2025-03-09 01:45:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349050657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866719744] [2025-03-09 01:45:33,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:45:33,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:33,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:33,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:33,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:45:33,161 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 163 statements into 2 equivalence classes. [2025-03-09 01:45:33,208 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-09 01:45:33,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:45:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:33,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-09 01:45:33,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:33,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:45:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866719744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:35,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:35,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 100 [2025-03-09 01:45:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983021491] [2025-03-09 01:45:35,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:35,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-03-09 01:45:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:35,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-03-09 01:45:35,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2450, Invalid=7650, Unknown=0, NotChecked=0, Total=10100 [2025-03-09 01:45:35,087 INFO L87 Difference]: Start difference. First operand 210 states and 233 transitions. Second operand has 101 states, 100 states have (on average 3.41) internal successors, (341), 101 states have internal predecessors, (341), 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) [2025-03-09 01:45:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:36,299 INFO L93 Difference]: Finished difference Result 427 states and 497 transitions. [2025-03-09 01:45:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-09 01:45:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 3.41) internal successors, (341), 101 states have internal predecessors, (341), 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 163 [2025-03-09 01:45:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:36,301 INFO L225 Difference]: With dead ends: 427 [2025-03-09 01:45:36,301 INFO L226 Difference]: Without dead ends: 426 [2025-03-09 01:45:36,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5003 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4546, Invalid=14360, Unknown=0, NotChecked=0, Total=18906 [2025-03-09 01:45:36,305 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 462 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:36,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 281 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:45:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-09 01:45:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-09 01:45:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.1129411764705883) internal successors, (473), 425 states have internal predecessors, (473), 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) [2025-03-09 01:45:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 473 transitions. [2025-03-09 01:45:36,328 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 473 transitions. Word has length 163 [2025-03-09 01:45:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 473 transitions. [2025-03-09 01:45:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 3.41) internal successors, (341), 101 states have internal predecessors, (341), 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) [2025-03-09 01:45:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 473 transitions. [2025-03-09 01:45:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-09 01:45:36,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:36,334 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1] [2025-03-09 01:45:36,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:45:36,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:36,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:36,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1395708724, now seen corresponding path program 5 times [2025-03-09 01:45:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:36,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-09 01:45:36,536 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:45:36,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:36,554 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-03-09 01:45:36,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 331 statements. [2025-03-09 01:45:36,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 01:45:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 5503 proven. 1425 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-09 01:45:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:45:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-09 01:45:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279464482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:45:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137097019] [2025-03-09 01:45:46,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:45:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:45:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:45:46,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:45:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:45:46,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 331 statements into 47 equivalence classes. [2025-03-09 01:45:46,905 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 217 of 331 statements. [2025-03-09 01:45:46,905 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-09 01:45:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:45:46,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-09 01:45:46,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:45:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 6865 proven. 63 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-09 01:45:49,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:45:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 6910 proven. 18 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2025-03-09 01:45:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137097019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:45:51,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:45:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 66, 36] total 123 [2025-03-09 01:45:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832597719] [2025-03-09 01:45:51,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:45:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2025-03-09 01:45:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:45:51,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2025-03-09 01:45:51,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3267, Invalid=11739, Unknown=0, NotChecked=0, Total=15006 [2025-03-09 01:45:51,788 INFO L87 Difference]: Start difference. First operand 426 states and 473 transitions. Second operand has 123 states, 123 states have (on average 4.065040650406504) internal successors, (500), 123 states have internal predecessors, (500), 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) [2025-03-09 01:45:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:45:55,274 INFO L93 Difference]: Finished difference Result 9119 states and 10111 transitions. [2025-03-09 01:45:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-03-09 01:45:55,275 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 4.065040650406504) internal successors, (500), 123 states have internal predecessors, (500), 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 331 [2025-03-09 01:45:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:45:55,302 INFO L225 Difference]: With dead ends: 9119 [2025-03-09 01:45:55,302 INFO L226 Difference]: Without dead ends: 8864 [2025-03-09 01:45:55,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 567 SyntacticMatches, 76 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21826 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11666, Invalid=36514, Unknown=0, NotChecked=0, Total=48180 [2025-03-09 01:45:55,316 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 318 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 3751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:45:55,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 2200 Invalid, 3751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-09 01:45:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2025-03-09 01:45:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 8834. [2025-03-09 01:45:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8834 states, 8833 states have (on average 1.1118532774821692) internal successors, (9821), 8833 states have internal predecessors, (9821), 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) [2025-03-09 01:45:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8834 states to 8834 states and 9821 transitions. [2025-03-09 01:45:55,550 INFO L78 Accepts]: Start accepts. Automaton has 8834 states and 9821 transitions. Word has length 331 [2025-03-09 01:45:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:45:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 8834 states and 9821 transitions. [2025-03-09 01:45:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 4.065040650406504) internal successors, (500), 123 states have internal predecessors, (500), 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) [2025-03-09 01:45:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8834 states and 9821 transitions. [2025-03-09 01:45:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-09 01:45:55,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:45:55,569 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 30, 30, 30, 17, 17, 17, 1, 1, 1] [2025-03-09 01:45:55,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:45:55,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:45:55,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 01:45:55,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:45:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1909206221, now seen corresponding path program 1 times [2025-03-09 01:45:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:45:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528811034] [2025-03-09 01:45:55,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:45:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:45:55,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-09 01:45:55,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 01:45:55,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:45:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 5610 proven. 142 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2025-03-09 01:46:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:46:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528811034] [2025-03-09 01:46:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528811034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:46:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837625440] [2025-03-09 01:46:00,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:46:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:46:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:46:00,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:46:00,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:46:00,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-09 01:46:00,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 01:46:00,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:46:00,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:46:00,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-09 01:46:00,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:46:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 0 proven. 6547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:46:04,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:46:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6547 backedges. 0 proven. 6547 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:46:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837625440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:46:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:46:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 95, 95] total 252 [2025-03-09 01:46:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729068344] [2025-03-09 01:46:10,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:46:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 252 states [2025-03-09 01:46:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:46:10,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 252 interpolants. [2025-03-09 01:46:10,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10554, Invalid=52698, Unknown=0, NotChecked=0, Total=63252 [2025-03-09 01:46:10,910 INFO L87 Difference]: Start difference. First operand 8834 states and 9821 transitions. Second operand has 252 states, 252 states have (on average 3.5357142857142856) internal successors, (891), 252 states have internal predecessors, (891), 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)