./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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/NestedRecursion_2c.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 e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:28:40,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:28:40,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:28:40,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:28:40,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:28:40,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:28:40,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:28:40,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:28:40,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:28:40,346 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:28:40,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:28:40,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:28:40,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:28:40,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:28:40,347 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:28:40,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:40,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:28:40,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:28:40,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:28:40,349 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 -> e757bed859e5dfb8bc677e07409ebb4da6a15dd0898403a302646229a6409be5 [2025-03-04 10:28:40,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:28:40,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:28:40,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:28:40,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:28:40,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:28:40,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-03-04 10:28:41,694 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc2184b7/fc33705983564345936b611ac4cabbf5/FLAG4761f7ff1 [2025-03-04 10:28:41,927 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:28:41,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2c.c [2025-03-04 10:28:41,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc2184b7/fc33705983564345936b611ac4cabbf5/FLAG4761f7ff1 [2025-03-04 10:28:42,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc2184b7/fc33705983564345936b611ac4cabbf5 [2025-03-04 10:28:42,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:28:42,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:28:42,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:42,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:28:42,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:28:42,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa233aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42, skipping insertion in model container [2025-03-04 10:28:42,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:28:42,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:42,400 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:28:42,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:28:42,425 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:28:42,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42 WrapperNode [2025-03-04 10:28:42,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:28:42,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:42,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:28:42,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:28:42,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,446 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12 [2025-03-04 10:28:42,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:28:42,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:28:42,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:28:42,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:28:42,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,456 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:28:42,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:28:42,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:28:42,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:28:42,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:28:42,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (1/1) ... [2025-03-04 10:28:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:28:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:42,491 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-04 10:28:42,495 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-04 10:28:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-03-04 10:28:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-03-04 10:28:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:28:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:28:42,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:28:42,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:28:42,632 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 10:28:42,632 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:28:42,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:28:42,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:28:42,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:42 BoogieIcfgContainer [2025-03-04 10:28:42,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:28:42,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:28:42,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:28:42,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:28:42,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:28:42" (1/3) ... [2025-03-04 10:28:42,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fd7afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:42, skipping insertion in model container [2025-03-04 10:28:42,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:28:42" (2/3) ... [2025-03-04 10:28:42,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fd7afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:28:42, skipping insertion in model container [2025-03-04 10:28:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:28:42" (3/3) ... [2025-03-04 10:28:42,648 INFO L128 eAbstractionObserver]: Analyzing ICFG NestedRecursion_2c.c [2025-03-04 10:28:42,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:28:42,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG NestedRecursion_2c.c that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 10:28:42,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:28:42,719 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;@1fd0bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:28:42,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:28:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:28:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:28:42,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:42,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:42,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:42,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1330671589, now seen corresponding path program 1 times [2025-03-04 10:28:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608557268] [2025-03-04 10:28:42,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:42,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:28:42,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:28:42,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:42,924 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-04 10:28:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608557268] [2025-03-04 10:28:42,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608557268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:42,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798816435] [2025-03-04 10:28:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:42,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:42,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:42,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:42,945 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:43,035 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-04 10:28:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:28:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:43,040 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:28:43,041 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:28:43,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:43,044 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:43,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:28:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-04 10:28:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:28:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-04 10:28:43,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2025-03-04 10:28:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:43,067 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-04 10:28:43,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-04 10:28:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:28:43,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:43,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:28:43,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:43,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1698853722, now seen corresponding path program 1 times [2025-03-04 10:28:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491974726] [2025-03-04 10:28:43,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:43,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:28:43,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:28:43,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:43,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:43,125 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-04 10:28:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:43,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491974726] [2025-03-04 10:28:43,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491974726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:43,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:43,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150179675] [2025-03-04 10:28:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:43,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:43,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:43,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:43,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:43,128 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:43,180 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-04 10:28:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:28:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:43,183 INFO L225 Difference]: With dead ends: 47 [2025-03-04 10:28:43,185 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 10:28:43,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:43,185 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:43,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 10:28:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-04 10:28:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:28:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2025-03-04 10:28:43,196 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 8 [2025-03-04 10:28:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2025-03-04 10:28:43,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2025-03-04 10:28:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:28:43,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:43,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:43,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:28:43,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:43,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1304875433, now seen corresponding path program 1 times [2025-03-04 10:28:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401836401] [2025-03-04 10:28:43,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:43,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:28:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:28:43,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:43,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401836401] [2025-03-04 10:28:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401836401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466212771] [2025-03-04 10:28:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:43,279 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-04 10:28:43,280 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-04 10:28:43,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:28:43,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:28:43,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:43,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:28:43,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:43,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466212771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:43,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:43,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-04 10:28:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85411130] [2025-03-04 10:28:43,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:43,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:28:43,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:43,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:28:43,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:28:43,429 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:43,595 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2025-03-04 10:28:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:28:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:28:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:43,597 INFO L225 Difference]: With dead ends: 96 [2025-03-04 10:28:43,597 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 10:28:43,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:28:43,598 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 123 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:43,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 132 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 10:28:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2025-03-04 10:28:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 59 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:28:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2025-03-04 10:28:43,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 12 [2025-03-04 10:28:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:43,614 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2025-03-04 10:28:43,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2025-03-04 10:28:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:28:43,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:43,614 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:43,622 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-04 10:28:43,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:43,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:43,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 193082324, now seen corresponding path program 1 times [2025-03-04 10:28:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724834905] [2025-03-04 10:28:43,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:28:43,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:28:43,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:43,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724834905] [2025-03-04 10:28:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724834905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:43,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:28:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365927575] [2025-03-04 10:28:43,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:43,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:28:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:43,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:28:43,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:28:43,869 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:43,908 INFO L93 Difference]: Finished difference Result 117 states and 166 transitions. [2025-03-04 10:28:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:28:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-04 10:28:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:43,914 INFO L225 Difference]: With dead ends: 117 [2025-03-04 10:28:43,914 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 10:28:43,915 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-04 10:28:43,915 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:43,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 10:28:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2025-03-04 10:28:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 75 states have internal predecessors, (92), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 10:28:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2025-03-04 10:28:43,937 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 15 [2025-03-04 10:28:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:43,937 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2025-03-04 10:28:43,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2025-03-04 10:28:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:28:43,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:43,939 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:28:43,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1690584721, now seen corresponding path program 1 times [2025-03-04 10:28:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738427214] [2025-03-04 10:28:43,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:43,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:28:43,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:28:43,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:43,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738427214] [2025-03-04 10:28:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738427214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:28:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348072965] [2025-03-04 10:28:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:28:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:43,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:28:43,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:28:43,969 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:43,996 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2025-03-04 10:28:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:28:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:28:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:43,999 INFO L225 Difference]: With dead ends: 99 [2025-03-04 10:28:43,999 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 10:28:43,999 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-04 10:28:43,999 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:44,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 10:28:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 10:28:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 74 states have internal predecessors, (86), 13 states have call successors, (13), 6 states have call predecessors, (13), 10 states have return successors, (22), 17 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-04 10:28:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-03-04 10:28:44,011 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 16 [2025-03-04 10:28:44,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:44,012 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-03-04 10:28:44,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-03-04 10:28:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:28:44,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:44,013 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:44,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:28:44,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:44,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1160385028, now seen corresponding path program 1 times [2025-03-04 10:28:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:44,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563276344] [2025-03-04 10:28:44,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:44,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:28:44,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:28:44,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:44,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563276344] [2025-03-04 10:28:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563276344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871484900] [2025-03-04 10:28:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:44,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:44,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:44,088 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:44,199 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2025-03-04 10:28:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:28:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 10:28:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:44,201 INFO L225 Difference]: With dead ends: 137 [2025-03-04 10:28:44,201 INFO L226 Difference]: Without dead ends: 136 [2025-03-04 10:28:44,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:28:44,203 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:44,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:44,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-04 10:28:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-03-04 10:28:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 98 states have internal predecessors, (107), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (32), 20 states have call predecessors, (32), 19 states have call successors, (32) [2025-03-04 10:28:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2025-03-04 10:28:44,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 20 [2025-03-04 10:28:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:44,228 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2025-03-04 10:28:44,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2025-03-04 10:28:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:28:44,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:44,229 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:44,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:28:44,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:44,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1612197479, now seen corresponding path program 1 times [2025-03-04 10:28:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547109850] [2025-03-04 10:28:44,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:44,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:28:44,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:28:44,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:44,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547109850] [2025-03-04 10:28:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547109850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:44,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:28:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300327306] [2025-03-04 10:28:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:44,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:44,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:44,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:44,285 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:44,367 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2025-03-04 10:28:44,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:28:44,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-04 10:28:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:44,369 INFO L225 Difference]: With dead ends: 156 [2025-03-04 10:28:44,369 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 10:28:44,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:28:44,370 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:44,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 78 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 10:28:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2025-03-04 10:28:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 112 states have internal predecessors, (122), 25 states have call successors, (25), 8 states have call predecessors, (25), 13 states have return successors, (37), 23 states have call predecessors, (37), 22 states have call successors, (37) [2025-03-04 10:28:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 184 transitions. [2025-03-04 10:28:44,392 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 184 transitions. Word has length 21 [2025-03-04 10:28:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:44,392 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 184 transitions. [2025-03-04 10:28:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 184 transitions. [2025-03-04 10:28:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:28:44,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:44,393 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:44,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:28:44,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 570099608, now seen corresponding path program 2 times [2025-03-04 10:28:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426643674] [2025-03-04 10:28:44,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:44,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:28:44,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:28:44,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426643674] [2025-03-04 10:28:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426643674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666776007] [2025-03-04 10:28:44,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:44,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:44,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:44,460 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-04 10:28:44,461 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-04 10:28:44,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:28:44,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:28:44,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:44,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:44,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:28:44,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:44,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:44,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666776007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:44,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:44,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 10:28:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374315175] [2025-03-04 10:28:44,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:44,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:28:44,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:44,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:28:44,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:28:44,600 INFO L87 Difference]: Start difference. First operand 144 states and 184 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:44,897 INFO L93 Difference]: Finished difference Result 215 states and 277 transitions. [2025-03-04 10:28:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:28:44,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:28:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:44,898 INFO L225 Difference]: With dead ends: 215 [2025-03-04 10:28:44,898 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 10:28:44,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:28:44,899 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 165 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:44,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 128 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:28:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 10:28:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 198. [2025-03-04 10:28:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.176056338028169) internal successors, (167), 154 states have internal predecessors, (167), 34 states have call successors, (34), 11 states have call predecessors, (34), 19 states have return successors, (52), 32 states have call predecessors, (52), 31 states have call successors, (52) [2025-03-04 10:28:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 253 transitions. [2025-03-04 10:28:44,924 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 253 transitions. Word has length 25 [2025-03-04 10:28:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 253 transitions. [2025-03-04 10:28:44,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 253 transitions. [2025-03-04 10:28:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:28:44,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:44,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:28:44,931 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-04 10:28:45,125 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-04 10:28:45,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -322777499, now seen corresponding path program 2 times [2025-03-04 10:28:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329917842] [2025-03-04 10:28:45,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:45,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:28:45,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:28:45,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:45,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329917842] [2025-03-04 10:28:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329917842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:45,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840579463] [2025-03-04 10:28:45,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:45,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:45,262 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-04 10:28:45,264 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-04 10:28:45,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:28:45,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:28:45,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:45,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:28:45,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:45,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840579463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:45,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-03-04 10:28:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379748617] [2025-03-04 10:28:45,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:45,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:28:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:45,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:28:45,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:28:45,483 INFO L87 Difference]: Start difference. First operand 198 states and 253 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:45,778 INFO L93 Difference]: Finished difference Result 319 states and 414 transitions. [2025-03-04 10:28:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:28:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 10:28:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:45,779 INFO L225 Difference]: With dead ends: 319 [2025-03-04 10:28:45,780 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 10:28:45,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:28:45,781 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 321 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:45,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 242 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:28:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 10:28:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2025-03-04 10:28:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 220 states have (on average 1.1681818181818182) internal successors, (257), 238 states have internal predecessors, (257), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-03-04 10:28:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 391 transitions. [2025-03-04 10:28:45,813 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 391 transitions. Word has length 27 [2025-03-04 10:28:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:45,813 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 391 transitions. [2025-03-04 10:28:45,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 391 transitions. [2025-03-04 10:28:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:28:45,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:45,814 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:45,820 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-04 10:28:46,015 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-04 10:28:46,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1385679627, now seen corresponding path program 1 times [2025-03-04 10:28:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208121668] [2025-03-04 10:28:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:46,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:28:46,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:28:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208121668] [2025-03-04 10:28:46,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208121668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:46,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:46,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:28:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799505281] [2025-03-04 10:28:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:46,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:28:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:46,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:28:46,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:28:46,049 INFO L87 Difference]: Start difference. First operand 306 states and 391 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:46,072 INFO L93 Difference]: Finished difference Result 306 states and 391 transitions. [2025-03-04 10:28:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:28:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-04 10:28:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:46,073 INFO L225 Difference]: With dead ends: 306 [2025-03-04 10:28:46,073 INFO L226 Difference]: Without dead ends: 305 [2025-03-04 10:28:46,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:46,074 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:46,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:46,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-04 10:28:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-04 10:28:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 220 states have (on average 1.0909090909090908) internal successors, (240), 237 states have internal predecessors, (240), 52 states have call successors, (52), 17 states have call predecessors, (52), 31 states have return successors, (82), 50 states have call predecessors, (82), 49 states have call successors, (82) [2025-03-04 10:28:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 374 transitions. [2025-03-04 10:28:46,095 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 374 transitions. Word has length 31 [2025-03-04 10:28:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:46,096 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 374 transitions. [2025-03-04 10:28:46,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 374 transitions. [2025-03-04 10:28:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 10:28:46,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:46,099 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:46,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:28:46,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:46,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -802382461, now seen corresponding path program 1 times [2025-03-04 10:28:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085607166] [2025-03-04 10:28:46,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:46,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:28:46,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:28:46,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:46,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085607166] [2025-03-04 10:28:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085607166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:28:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606971882] [2025-03-04 10:28:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:28:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:28:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:46,170 INFO L87 Difference]: Start difference. First operand 305 states and 374 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:46,263 INFO L93 Difference]: Finished difference Result 327 states and 416 transitions. [2025-03-04 10:28:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:28:46,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-04 10:28:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:46,265 INFO L225 Difference]: With dead ends: 327 [2025-03-04 10:28:46,265 INFO L226 Difference]: Without dead ends: 326 [2025-03-04 10:28:46,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:28:46,266 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:46,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-04 10:28:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2025-03-04 10:28:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 232 states have (on average 1.0948275862068966) internal successors, (254), 249 states have internal predecessors, (254), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-03-04 10:28:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 379 transitions. [2025-03-04 10:28:46,293 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 379 transitions. Word has length 36 [2025-03-04 10:28:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:46,293 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 379 transitions. [2025-03-04 10:28:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 379 transitions. [2025-03-04 10:28:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 10:28:46,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:46,295 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:46,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:28:46,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 895947464, now seen corresponding path program 1 times [2025-03-04 10:28:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984286618] [2025-03-04 10:28:46,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:28:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:28:46,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:28:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:28:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:46,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:46,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984286618] [2025-03-04 10:28:46,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984286618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:46,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:46,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:28:46,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145031263] [2025-03-04 10:28:46,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:46,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:28:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:46,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:28:46,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:28:46,369 INFO L87 Difference]: Start difference. First operand 321 states and 379 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:46,473 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2025-03-04 10:28:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:28:46,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-04 10:28:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:46,475 INFO L225 Difference]: With dead ends: 326 [2025-03-04 10:28:46,475 INFO L226 Difference]: Without dead ends: 325 [2025-03-04 10:28:46,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:28:46,476 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:46,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-04 10:28:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 320. [2025-03-04 10:28:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 232 states have (on average 1.0862068965517242) internal successors, (252), 248 states have internal predecessors, (252), 55 states have call successors, (55), 18 states have call predecessors, (55), 32 states have return successors, (70), 53 states have call predecessors, (70), 52 states have call successors, (70) [2025-03-04 10:28:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 377 transitions. [2025-03-04 10:28:46,498 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 377 transitions. Word has length 37 [2025-03-04 10:28:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:46,498 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 377 transitions. [2025-03-04 10:28:46,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:28:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 377 transitions. [2025-03-04 10:28:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:28:46,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:46,499 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:46,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:28:46,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:46,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash -839046396, now seen corresponding path program 3 times [2025-03-04 10:28:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:46,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158618302] [2025-03-04 10:28:46,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:46,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-04 10:28:46,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:28:46,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 10:28:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158618302] [2025-03-04 10:28:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158618302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828086880] [2025-03-04 10:28:46,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:46,653 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-04 10:28:46,654 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-04 10:28:46,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-04 10:28:46,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:28:46,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 10:28:46,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:46,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:28:46,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:46,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:28:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828086880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:46,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:46,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 10:28:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960480016] [2025-03-04 10:28:46,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:46,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:28:46,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:46,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:28:46,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:28:46,900 INFO L87 Difference]: Start difference. First operand 320 states and 377 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:47,528 INFO L93 Difference]: Finished difference Result 456 states and 580 transitions. [2025-03-04 10:28:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 10:28:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-03-04 10:28:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:47,530 INFO L225 Difference]: With dead ends: 456 [2025-03-04 10:28:47,530 INFO L226 Difference]: Without dead ends: 455 [2025-03-04 10:28:47,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=721, Invalid=2471, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 10:28:47,532 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 460 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:47,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 174 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:28:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-04 10:28:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 428. [2025-03-04 10:28:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 310 states have (on average 1.0838709677419356) internal successors, (336), 332 states have internal predecessors, (336), 73 states have call successors, (73), 24 states have call predecessors, (73), 44 states have return successors, (94), 71 states have call predecessors, (94), 70 states have call successors, (94) [2025-03-04 10:28:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 503 transitions. [2025-03-04 10:28:47,552 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 503 transitions. Word has length 40 [2025-03-04 10:28:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:47,553 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 503 transitions. [2025-03-04 10:28:47,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (12), 11 states have call predecessors, (12), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:28:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 503 transitions. [2025-03-04 10:28:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 10:28:47,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:47,553 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:47,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:47,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:47,754 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash 848221049, now seen corresponding path program 2 times [2025-03-04 10:28:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:47,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099925050] [2025-03-04 10:28:47,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:47,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:47,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 10:28:47,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:28:47,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:47,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099925050] [2025-03-04 10:28:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099925050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031467358] [2025-03-04 10:28:47,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:28:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:47,818 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-04 10:28:47,820 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-04 10:28:47,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-04 10:28:47,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:28:47,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:28:47,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:47,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:28:47,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:47,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031467358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:47,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:28:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792553151] [2025-03-04 10:28:47,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:47,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:28:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:47,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:28:47,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:28:47,982 INFO L87 Difference]: Start difference. First operand 428 states and 503 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:48,300 INFO L93 Difference]: Finished difference Result 487 states and 623 transitions. [2025-03-04 10:28:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 10:28:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2025-03-04 10:28:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:48,302 INFO L225 Difference]: With dead ends: 487 [2025-03-04 10:28:48,302 INFO L226 Difference]: Without dead ends: 486 [2025-03-04 10:28:48,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=328, Invalid=1154, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 10:28:48,304 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:48,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 124 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:28:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-04 10:28:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 482. [2025-03-04 10:28:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 349 states have (on average 1.0830945558739256) internal successors, (378), 374 states have internal predecessors, (378), 82 states have call successors, (82), 27 states have call predecessors, (82), 50 states have return successors, (106), 80 states have call predecessors, (106), 79 states have call successors, (106) [2025-03-04 10:28:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 566 transitions. [2025-03-04 10:28:48,332 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 566 transitions. Word has length 41 [2025-03-04 10:28:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:48,333 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 566 transitions. [2025-03-04 10:28:48,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 566 transitions. [2025-03-04 10:28:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 10:28:48,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:48,335 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-04 10:28:48,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:48,540 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,SelfDestructingSolverStorable13 [2025-03-04 10:28:48,540 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 913040421, now seen corresponding path program 3 times [2025-03-04 10:28:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914367855] [2025-03-04 10:28:48,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:48,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 10:28:48,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:28:48,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:28:48,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914367855] [2025-03-04 10:28:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914367855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288633668] [2025-03-04 10:28:48,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:48,854 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-04 10:28:48,855 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-04 10:28:48,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 11 equivalence classes. [2025-03-04 10:28:48,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 10:28:48,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:28:48,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:48,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:28:48,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:48,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288633668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:49,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:49,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-03-04 10:28:49,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005873616] [2025-03-04 10:28:49,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:49,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 10:28:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:49,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 10:28:49,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:28:49,429 INFO L87 Difference]: Start difference. First operand 482 states and 566 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:50,172 INFO L93 Difference]: Finished difference Result 703 states and 908 transitions. [2025-03-04 10:28:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:28:50,172 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-04 10:28:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:50,175 INFO L225 Difference]: With dead ends: 703 [2025-03-04 10:28:50,175 INFO L226 Difference]: Without dead ends: 702 [2025-03-04 10:28:50,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-03-04 10:28:50,178 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 773 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:50,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 457 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:28:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-04 10:28:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2025-03-04 10:28:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 505 states have (on average 1.0811881188118813) internal successors, (546), 542 states have internal predecessors, (546), 118 states have call successors, (118), 39 states have call predecessors, (118), 74 states have return successors, (154), 116 states have call predecessors, (154), 115 states have call successors, (154) [2025-03-04 10:28:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 818 transitions. [2025-03-04 10:28:50,207 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 818 transitions. Word has length 57 [2025-03-04 10:28:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:50,207 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 818 transitions. [2025-03-04 10:28:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 26 states have internal predecessors, (90), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 818 transitions. [2025-03-04 10:28:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:28:50,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:50,208 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:50,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:28:50,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:28:50,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:50,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 288227587, now seen corresponding path program 3 times [2025-03-04 10:28:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65974043] [2025-03-04 10:28:50,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:50,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 9 equivalence classes. [2025-03-04 10:28:50,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 48 of 56 statements. [2025-03-04 10:28:50,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:28:50,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:50,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65974043] [2025-03-04 10:28:50,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65974043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:50,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222613184] [2025-03-04 10:28:50,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:28:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:50,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:28:50,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 9 equivalence classes. [2025-03-04 10:28:50,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 48 of 56 statements. [2025-03-04 10:28:50,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 10:28:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:50,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:28:50,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:50,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222613184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:50,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-04 10:28:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371727100] [2025-03-04 10:28:50,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:28:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:50,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:28:50,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:28:50,833 INFO L87 Difference]: Start difference. First operand 698 states and 818 transitions. Second operand has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 16 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:51,529 INFO L93 Difference]: Finished difference Result 811 states and 1040 transitions. [2025-03-04 10:28:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 10:28:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 16 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-04 10:28:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:51,532 INFO L225 Difference]: With dead ends: 811 [2025-03-04 10:28:51,533 INFO L226 Difference]: Without dead ends: 810 [2025-03-04 10:28:51,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1399, Invalid=5081, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 10:28:51,534 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 315 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:51,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 183 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:28:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-04 10:28:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 410. [2025-03-04 10:28:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 307 states have (on average 1.1140065146579805) internal successors, (342), 308 states have internal predecessors, (342), 69 states have call successors, (69), 34 states have call predecessors, (69), 33 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 10:28:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 478 transitions. [2025-03-04 10:28:51,556 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 478 transitions. Word has length 56 [2025-03-04 10:28:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 478 transitions. [2025-03-04 10:28:51,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 16 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 478 transitions. [2025-03-04 10:28:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:28:51,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:51,558 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:51,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:28:51,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:51,762 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:51,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1521590404, now seen corresponding path program 4 times [2025-03-04 10:28:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:51,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736959199] [2025-03-04 10:28:51,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:51,765 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 70 statements into 2 equivalence classes. [2025-03-04 10:28:51,768 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 70 statements. [2025-03-04 10:28:51,768 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:28:51,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-04 10:28:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736959199] [2025-03-04 10:28:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736959199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:28:51,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:28:51,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:28:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257785996] [2025-03-04 10:28:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:28:51,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:28:51,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:51,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:28:51,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:28:51,813 INFO L87 Difference]: Start difference. First operand 410 states and 478 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:51,860 INFO L93 Difference]: Finished difference Result 940 states and 1197 transitions. [2025-03-04 10:28:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:28:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2025-03-04 10:28:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:51,863 INFO L225 Difference]: With dead ends: 940 [2025-03-04 10:28:51,863 INFO L226 Difference]: Without dead ends: 643 [2025-03-04 10:28:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:28:51,867 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:51,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:28:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-04 10:28:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 608. [2025-03-04 10:28:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 440 states have (on average 1.0772727272727274) internal successors, (474), 472 states have internal predecessors, (474), 102 states have call successors, (102), 35 states have call predecessors, (102), 65 states have return successors, (133), 100 states have call predecessors, (133), 100 states have call successors, (133) [2025-03-04 10:28:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 709 transitions. [2025-03-04 10:28:51,906 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 709 transitions. Word has length 70 [2025-03-04 10:28:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:51,906 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 709 transitions. [2025-03-04 10:28:51,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:28:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 709 transitions. [2025-03-04 10:28:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:28:51,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:51,909 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 12, 12, 12, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:28:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:28:51,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:51,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1818177091, now seen corresponding path program 4 times [2025-03-04 10:28:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136930980] [2025-03-04 10:28:51,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:51,913 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-03-04 10:28:51,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:28:51,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:51,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136930980] [2025-03-04 10:28:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136930980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234963747] [2025-03-04 10:28:52,319 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:52,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:52,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:52,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:52,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:28:52,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-03-04 10:28:52,353 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:28:52,353 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:52,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:52,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:28:52,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:52,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 158 proven. 255 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:28:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234963747] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:52,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2025-03-04 10:28:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250852888] [2025-03-04 10:28:52,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:28:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:52,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:28:52,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:28:52,897 INFO L87 Difference]: Start difference. First operand 608 states and 709 transitions. Second operand has 52 states, 51 states have (on average 2.156862745098039) internal successors, (110), 28 states have internal predecessors, (110), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:55,126 INFO L93 Difference]: Finished difference Result 827 states and 1019 transitions. [2025-03-04 10:28:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2025-03-04 10:28:55,127 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.156862745098039) internal successors, (110), 28 states have internal predecessors, (110), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-04 10:28:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:55,130 INFO L225 Difference]: With dead ends: 827 [2025-03-04 10:28:55,130 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 10:28:55,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7843 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5809, Invalid=21251, Unknown=0, NotChecked=0, Total=27060 [2025-03-04 10:28:55,138 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 947 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:55,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 228 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:28:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 10:28:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 824. [2025-03-04 10:28:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 596 states have (on average 1.0771812080536913) internal successors, (642), 640 states have internal predecessors, (642), 138 states have call successors, (138), 47 states have call predecessors, (138), 89 states have return successors, (181), 136 states have call predecessors, (181), 136 states have call successors, (181) [2025-03-04 10:28:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 961 transitions. [2025-03-04 10:28:55,191 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 961 transitions. Word has length 86 [2025-03-04 10:28:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:28:55,191 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 961 transitions. [2025-03-04 10:28:55,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.156862745098039) internal successors, (110), 28 states have internal predecessors, (110), 23 states have call successors, (25), 23 states have call predecessors, (25), 3 states have return successors, (5), 5 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:28:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 961 transitions. [2025-03-04 10:28:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 10:28:55,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:28:55,194 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-04 10:28:55,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:28:55,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:28:55,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:28:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:28:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -169582683, now seen corresponding path program 4 times [2025-03-04 10:28:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:28:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405031135] [2025-03-04 10:28:55,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:28:55,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 10:28:55,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:28:55,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:55,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:28:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405031135] [2025-03-04 10:28:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405031135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:28:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215724616] [2025-03-04 10:28:56,344 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:28:56,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:28:56,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:28:56,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:28:56,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:28:56,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 117 statements into 2 equivalence classes. [2025-03-04 10:28:56,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 10:28:56,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:28:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:28:56,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 10:28:56,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:28:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:56,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:28:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:28:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215724616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:28:57,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:28:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-03-04 10:28:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665981042] [2025-03-04 10:28:57,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:28:57,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-04 10:28:57,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:28:57,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-04 10:28:57,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 10:28:57,879 INFO L87 Difference]: Start difference. First operand 824 states and 961 transitions. Second operand has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:28:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:28:59,986 INFO L93 Difference]: Finished difference Result 1259 states and 1559 transitions. [2025-03-04 10:28:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 10:28:59,986 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-04 10:28:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:28:59,991 INFO L225 Difference]: With dead ends: 1259 [2025-03-04 10:28:59,991 INFO L226 Difference]: Without dead ends: 1258 [2025-03-04 10:28:59,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-03-04 10:28:59,993 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2516 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:28:59,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 685 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:28:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2025-03-04 10:29:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2025-03-04 10:29:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 908 states have (on average 1.077092511013216) internal successors, (978), 976 states have internal predecessors, (978), 210 states have call successors, (210), 71 states have call predecessors, (210), 137 states have return successors, (277), 208 states have call predecessors, (277), 208 states have call successors, (277) [2025-03-04 10:29:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1465 transitions. [2025-03-04 10:29:00,048 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1465 transitions. Word has length 117 [2025-03-04 10:29:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:29:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1465 transitions. [2025-03-04 10:29:00,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 93 states have (on average 2.0) internal successors, (186), 50 states have internal predecessors, (186), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:29:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1465 transitions. [2025-03-04 10:29:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 10:29:00,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:29:00,052 INFO L218 NwaCegarLoop]: trace histogram [27, 25, 24, 24, 24, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:29:00,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:29:00,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:29:00,258 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:29:00,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:29:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -544900925, now seen corresponding path program 5 times [2025-03-04 10:29:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:29:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814632958] [2025-03-04 10:29:00,259 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:29:00,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:29:00,263 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 146 statements into 26 equivalence classes. [2025-03-04 10:29:00,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 84 of 146 statements. [2025-03-04 10:29:00,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-03-04 10:29:00,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-03-04 10:29:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:29:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814632958] [2025-03-04 10:29:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814632958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:29:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:29:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:29:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115887286] [2025-03-04 10:29:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:29:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:29:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:29:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:29:00,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:29:00,344 INFO L87 Difference]: Start difference. First operand 1256 states and 1465 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:29:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:29:00,398 INFO L93 Difference]: Finished difference Result 1591 states and 1891 transitions. [2025-03-04 10:29:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:29:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 146 [2025-03-04 10:29:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:29:00,401 INFO L225 Difference]: With dead ends: 1591 [2025-03-04 10:29:00,401 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 10:29:00,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:29:00,406 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:29:00,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:29:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 10:29:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-03-04 10:29:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 190 states have (on average 1.0052631578947369) internal successors, (191), 190 states have internal predecessors, (191), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:29:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2025-03-04 10:29:00,414 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 146 [2025-03-04 10:29:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:29:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2025-03-04 10:29:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:29:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2025-03-04 10:29:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 10:29:00,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:29:00,417 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2025-03-04 10:29:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:29:00,417 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:29:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:29:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1266772315, now seen corresponding path program 5 times [2025-03-04 10:29:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:29:00,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936461233] [2025-03-04 10:29:00,418 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:29:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:29:00,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 10:29:00,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 10:29:00,551 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:29:00,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936461233] [2025-03-04 10:29:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936461233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100912943] [2025-03-04 10:29:03,376 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:29:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:29:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:29:03,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:29:03,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:29:03,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 237 statements into 47 equivalence classes. [2025-03-04 10:29:03,501 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 10:29:03,501 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:29:03,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:03,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 10:29:03,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:29:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:03,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:29:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100912943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:29:08,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:29:08,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-03-04 10:29:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078892068] [2025-03-04 10:29:08,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:29:08,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-03-04 10:29:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:29:08,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-03-04 10:29:08,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:29:08,624 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:29:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:29:13,397 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2025-03-04 10:29:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 10:29:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-03-04 10:29:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:29:13,399 INFO L225 Difference]: With dead ends: 481 [2025-03-04 10:29:13,399 INFO L226 Difference]: Without dead ends: 480 [2025-03-04 10:29:13,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-03-04 10:29:13,405 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1605 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:29:13,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 31 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:29:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-04 10:29:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2025-03-04 10:29:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 382 states have (on average 1.0026178010471205) internal successors, (383), 382 states have internal predecessors, (383), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:29:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 478 transitions. [2025-03-04 10:29:13,418 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 478 transitions. Word has length 237 [2025-03-04 10:29:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:29:13,419 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 478 transitions. [2025-03-04 10:29:13,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 189 states have (on average 2.0) internal successors, (378), 98 states have internal predecessors, (378), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:29:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 478 transitions. [2025-03-04 10:29:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 10:29:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:29:13,423 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 1, 1, 1, 1, 1] [2025-03-04 10:29:13,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:29:13,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:29:13,623 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:29:13,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:29:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash 551027877, now seen corresponding path program 6 times [2025-03-04 10:29:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:29:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206341248] [2025-03-04 10:29:13,624 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:29:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:29:13,642 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 477 statements into 95 equivalence classes. [2025-03-04 10:29:13,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 10:29:13,777 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:29:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:29:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206341248] [2025-03-04 10:29:25,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206341248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:29:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22746909] [2025-03-04 10:29:25,381 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:29:25,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:29:25,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:29:25,383 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:29:25,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:29:25,415 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 477 statements into 95 equivalence classes. [2025-03-04 10:29:25,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 10:29:25,633 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:29:25,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:29:25,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-03-04 10:29:25,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:29:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:26,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:29:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22137 backedges. 0 proven. 22137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:29:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22746909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:29:45,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:29:45,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-03-04 10:29:45,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690929556] [2025-03-04 10:29:45,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:29:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-04 10:29:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:29:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-04 10:29:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 10:29:45,095 INFO L87 Difference]: Start difference. First operand 478 states and 478 transitions. Second operand has 384 states, 381 states have (on average 2.0) internal successors, (762), 194 states have internal predecessors, (762), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)