./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/Parts.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-numeric/Parts.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 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:57,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:57,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:57,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:57,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:57,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:57,088 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:57,088 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:57,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:57,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:57,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:57,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:57,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:57,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:57,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:57,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:57,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:57,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:57,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:57,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:57,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:57,092 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 -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2025-03-04 10:32:57,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:57,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:57,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:57,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:57,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:57,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2025-03-04 10:32:58,425 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04134615e/70827c9585d94a00947d89f31a103c94/FLAG0f1949024 [2025-03-04 10:32:58,614 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:58,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2025-03-04 10:32:58,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04134615e/70827c9585d94a00947d89f31a103c94/FLAG0f1949024 [2025-03-04 10:32:58,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04134615e/70827c9585d94a00947d89f31a103c94 [2025-03-04 10:32:58,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:58,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:58,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:58,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:58,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:58,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d86aa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58, skipping insertion in model container [2025-03-04 10:32:58,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:58,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:58,768 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:58,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:58,788 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:58,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58 WrapperNode [2025-03-04 10:32:58,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:58,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:58,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:58,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:58,793 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:32:58" (1/1) ... [2025-03-04 10:32:58,796 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:32:58" (1/1) ... [2025-03-04 10:32:58,807 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-04 10:32:58,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:58,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:58,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:58,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:58,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,818 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,821 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:32:58,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:58,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:58,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:58,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:58,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (1/1) ... [2025-03-04 10:32:58,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:58,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:58,860 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:32:58,863 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:32:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2025-03-04 10:32:58,884 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2025-03-04 10:32:58,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:58,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:58,922 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:58,924 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:59,052 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:59,052 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:59,058 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:59,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:59,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:59 BoogieIcfgContainer [2025-03-04 10:32:59,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:59,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:59,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:59,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:59,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:58" (1/3) ... [2025-03-04 10:32:59,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b0345f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:59, skipping insertion in model container [2025-03-04 10:32:59,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:58" (2/3) ... [2025-03-04 10:32:59,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b0345f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:59, skipping insertion in model container [2025-03-04 10:32:59,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:59" (3/3) ... [2025-03-04 10:32:59,067 INFO L128 eAbstractionObserver]: Analyzing ICFG Parts.c [2025-03-04 10:32:59,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:59,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Parts.c that has 2 procedures, 43 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-04 10:32:59,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:59,115 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;@299eb015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:59,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 10:32:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:32:59,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2138962996, now seen corresponding path program 1 times [2025-03-04 10:32:59,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105096382] [2025-03-04 10:32:59,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:32:59,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:32:59,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,271 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:32:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105096382] [2025-03-04 10:32:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105096382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490621979] [2025-03-04 10:32:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:59,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:59,292 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,348 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2025-03-04 10:32:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:32:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,355 INFO L225 Difference]: With dead ends: 84 [2025-03-04 10:32:59,356 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 10:32:59,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:59,359 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 15 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 10:32:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-04 10:32:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 35 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2025-03-04 10:32:59,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 7 [2025-03-04 10:32:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,387 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2025-03-04 10:32:59,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2025-03-04 10:32:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:32:59,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:59,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting partsErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1601592749, now seen corresponding path program 1 times [2025-03-04 10:32:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897682658] [2025-03-04 10:32:59,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:32:59,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:32:59,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,425 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:32:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897682658] [2025-03-04 10:32:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897682658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:32:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350284086] [2025-03-04 10:32:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:32:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:32:59,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:32:59,427 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:32:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,451 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-03-04 10:32:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:32:59,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-03-04 10:32:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,452 INFO L225 Difference]: With dead ends: 43 [2025-03-04 10:32:59,452 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 10:32:59,453 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:32:59,453 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 10:32:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-04 10:32:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.5) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-04 10:32:59,459 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2025-03-04 10:32:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,459 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-04 10:32:59,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:32:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-04 10:32:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:32:59,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:59,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1869119757, now seen corresponding path program 1 times [2025-03-04 10:32:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320699171] [2025-03-04 10:32:59,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:32:59,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:32:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,513 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:32:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320699171] [2025-03-04 10:32:59,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320699171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871613623] [2025-03-04 10:32:59,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:59,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:59,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:59,515 INFO L87 Difference]: Start difference. First operand 40 states and 47 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,535 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-03-04 10:32:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:59,536 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 10:32:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,537 INFO L225 Difference]: With dead ends: 40 [2025-03-04 10:32:59,537 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 10:32:59,537 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:32:59,538 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 10:32:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 10:32:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 33 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2025-03-04 10:32:59,542 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 13 [2025-03-04 10:32:59,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,542 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2025-03-04 10:32:59,542 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2025-03-04 10:32:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:32:59,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:59,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1890232319, now seen corresponding path program 1 times [2025-03-04 10:32:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596598790] [2025-03-04 10:32:59,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:32:59,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:32:59,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,586 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:32:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596598790] [2025-03-04 10:32:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596598790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:32:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555724421] [2025-03-04 10:32:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:59,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:59,588 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:32:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,648 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-03-04 10:32:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2025-03-04 10:32:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,649 INFO L225 Difference]: With dead ends: 83 [2025-03-04 10:32:59,650 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:32:59,650 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:32:59,651 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:32:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-03-04 10:32:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 38 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:32:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-04 10:32:59,657 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 13 [2025-03-04 10:32:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-04 10:32:59,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:32:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-04 10:32:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:32:59,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:59,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2108137622, now seen corresponding path program 1 times [2025-03-04 10:32:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160739198] [2025-03-04 10:32:59,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,701 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:32:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160739198] [2025-03-04 10:32:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160739198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829002426] [2025-03-04 10:32:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:59,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:59,704 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,731 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2025-03-04 10:32:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 10:32:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,733 INFO L225 Difference]: With dead ends: 49 [2025-03-04 10:32:59,733 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:32:59,733 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:32:59,734 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:32:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 10:32:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.393939393939394) internal successors, (46), 40 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:32:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-04 10:32:59,740 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2025-03-04 10:32:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,740 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-04 10:32:59,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-04 10:32:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:32:59,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:32:59,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1304308908, now seen corresponding path program 1 times [2025-03-04 10:32:59,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845173811] [2025-03-04 10:32:59,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:32:59,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:32:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:59,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845173811] [2025-03-04 10:32:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845173811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654747723] [2025-03-04 10:32:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:59,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:59,788 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,804 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2025-03-04 10:32:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:59,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:32:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,805 INFO L225 Difference]: With dead ends: 48 [2025-03-04 10:32:59,805 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:32:59,805 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:32:59,806 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:59,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:32:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 10:32:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 39 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:32:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-03-04 10:32:59,813 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2025-03-04 10:32:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,813 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-03-04 10:32:59,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-03-04 10:32:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:32:59,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:32:59,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1778870486, now seen corresponding path program 1 times [2025-03-04 10:32:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687830326] [2025-03-04 10:32:59,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:32:59,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:32:59,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:32:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687830326] [2025-03-04 10:32:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687830326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135744179] [2025-03-04 10:32:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:59,864 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:59,888 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-04 10:32:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-04 10:32:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:59,890 INFO L225 Difference]: With dead ends: 62 [2025-03-04 10:32:59,890 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 10:32:59,890 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:32:59,891 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 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:32:59,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 10:32:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-04 10:32:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 50 states have internal predecessors, (58), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:32:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-03-04 10:32:59,898 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 17 [2025-03-04 10:32:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:59,898 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-03-04 10:32:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-03-04 10:32:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:32:59,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:59,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:59,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:32:59,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:32:59,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1533194631, now seen corresponding path program 1 times [2025-03-04 10:32:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85821691] [2025-03-04 10:32:59,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:32:59,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:32:59,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:59,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:32:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85821691] [2025-03-04 10:32:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85821691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:32:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573952789] [2025-03-04 10:32:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:59,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:59,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:59,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:59,943 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 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:33:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,000 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2025-03-04 10:33:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:00,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 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 22 [2025-03-04 10:33:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,001 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:33:00,001 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 10:33:00,002 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:33:00,004 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 145 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 10:33:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-04 10:33:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:33:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-04 10:33:00,011 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 22 [2025-03-04 10:33:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,011 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-04 10:33:00,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 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:33:00,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-04 10:33:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 10:33:00,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,012 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:33:00,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:00,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -370096114, now seen corresponding path program 1 times [2025-03-04 10:33:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867102679] [2025-03-04 10:33:00,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:33:00,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:33:00,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:33:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867102679] [2025-03-04 10:33:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867102679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038174619] [2025-03-04 10:33:00,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,085 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:33:00,086 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:33:00,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:33:00,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:33:00,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:33:00,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:33:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038174619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:00,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:33:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604834137] [2025-03-04 10:33:00,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:33:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:00,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:33:00,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:00,241 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:33:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,284 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2025-03-04 10:33:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:33:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2025-03-04 10:33:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,285 INFO L225 Difference]: With dead ends: 99 [2025-03-04 10:33:00,285 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 10:33:00,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:33:00,286 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 10:33:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 10:33:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 80 states have internal predecessors, (94), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:33:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2025-03-04 10:33:00,294 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 23 [2025-03-04 10:33:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,294 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2025-03-04 10:33:00,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:33:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2025-03-04 10:33:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:33:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,301 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:33:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 427379516, now seen corresponding path program 1 times [2025-03-04 10:33:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079388921] [2025-03-04 10:33:00,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:00,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:33:00,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:33:00,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:33:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079388921] [2025-03-04 10:33:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079388921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293365338] [2025-03-04 10:33:00,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,567 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:33:00,568 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:33:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:33:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:33:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:33:00,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:33:00,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293365338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:00,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:00,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-04 10:33:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590251949] [2025-03-04 10:33:00,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:00,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:33:00,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:00,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:33:00,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:00,770 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:33:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:00,847 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2025-03-04 10:33:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:00,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2025-03-04 10:33:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:00,850 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:33:00,850 INFO L226 Difference]: Without dead ends: 99 [2025-03-04 10:33:00,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:33:00,853 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:00,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 271 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-04 10:33:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-04 10:33:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 80 states have internal predecessors, (93), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:33:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2025-03-04 10:33:00,867 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 30 [2025-03-04 10:33:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:00,867 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2025-03-04 10:33:00,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:33:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2025-03-04 10:33:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 10:33:00,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:00,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:00,874 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:33:01,071 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,SelfDestructingSolverStorable9 [2025-03-04 10:33:01,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2076933452, now seen corresponding path program 2 times [2025-03-04 10:33:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:01,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482084929] [2025-03-04 10:33:01,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:01,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-04 10:33:01,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:33:01,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 10:33:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:01,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482084929] [2025-03-04 10:33:01,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482084929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:01,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:01,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258861826] [2025-03-04 10:33:01,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:01,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:01,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:01,181 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:01,292 INFO L93 Difference]: Finished difference Result 196 states and 257 transitions. [2025-03-04 10:33:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-04 10:33:01,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:01,294 INFO L225 Difference]: With dead ends: 196 [2025-03-04 10:33:01,295 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:33:01,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:01,295 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:01,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 115 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:33:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-03-04 10:33:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.2549019607843137) internal successors, (128), 107 states have internal predecessors, (128), 17 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (32), 20 states have call predecessors, (32), 17 states have call successors, (32) [2025-03-04 10:33:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2025-03-04 10:33:01,318 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 39 [2025-03-04 10:33:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:01,318 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2025-03-04 10:33:01,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:33:01,318 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2025-03-04 10:33:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:33:01,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:01,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:01,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:33:01,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:01,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1811689622, now seen corresponding path program 1 times [2025-03-04 10:33:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16767262] [2025-03-04 10:33:01,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:01,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:33:01,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:33:01,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:01,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:33:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16767262] [2025-03-04 10:33:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16767262] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142144324] [2025-03-04 10:33:01,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:01,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:01,430 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:33:01,432 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:33:01,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:33:01,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:33:01,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:01,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:01,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:01,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:33:01,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 10:33:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142144324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2025-03-04 10:33:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465740961] [2025-03-04 10:33:01,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:33:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:33:01,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:01,618 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:33:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,184 INFO L93 Difference]: Finished difference Result 393 states and 557 transitions. [2025-03-04 10:33:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-04 10:33:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 40 [2025-03-04 10:33:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,186 INFO L225 Difference]: With dead ends: 393 [2025-03-04 10:33:02,187 INFO L226 Difference]: Without dead ends: 298 [2025-03-04 10:33:02,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:33:02,188 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 497 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-04 10:33:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 263. [2025-03-04 10:33:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 212 states have internal predecessors, (253), 40 states have call successors, (40), 5 states have call predecessors, (40), 7 states have return successors, (82), 45 states have call predecessors, (82), 40 states have call successors, (82) [2025-03-04 10:33:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 375 transitions. [2025-03-04 10:33:02,219 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 375 transitions. Word has length 40 [2025-03-04 10:33:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 375 transitions. [2025-03-04 10:33:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:33:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 375 transitions. [2025-03-04 10:33:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:33:02,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:02,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:02,227 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:33:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:02,422 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting partsErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:02,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1660806245, now seen corresponding path program 1 times [2025-03-04 10:33:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:02,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632462725] [2025-03-04 10:33:02,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:33:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:33:02,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:02,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:02,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632462725] [2025-03-04 10:33:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632462725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759350481] [2025-03-04 10:33:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:02,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:02,518 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:33:02,520 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:33:02,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:33:02,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:33:02,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:02,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:02,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:02,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:02,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:33:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759350481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:02,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:02,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:33:02,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93706852] [2025-03-04 10:33:02,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:02,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:33:02,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:02,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:33:02,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:33:02,682 INFO L87 Difference]: Start difference. First operand 263 states and 375 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:33:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,885 INFO L93 Difference]: Finished difference Result 312 states and 473 transitions. [2025-03-04 10:33:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:33:02,886 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2025-03-04 10:33:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,889 INFO L225 Difference]: With dead ends: 312 [2025-03-04 10:33:02,889 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 10:33:02,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:33:02,889 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 182 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 10:33:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 297. [2025-03-04 10:33:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 236 states have (on average 1.2203389830508475) internal successors, (288), 238 states have internal predecessors, (288), 43 states have call successors, (43), 8 states have call predecessors, (43), 12 states have return successors, (91), 50 states have call predecessors, (91), 43 states have call successors, (91) [2025-03-04 10:33:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 422 transitions. [2025-03-04 10:33:02,912 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 422 transitions. Word has length 45 [2025-03-04 10:33:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:02,912 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 422 transitions. [2025-03-04 10:33:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:33:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 422 transitions. [2025-03-04 10:33:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 10:33:02,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:02,913 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:02,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:33:03,116 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:33:03,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:03,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2089963882, now seen corresponding path program 2 times [2025-03-04 10:33:03,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330429979] [2025-03-04 10:33:03,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:03,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:03,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:33:03,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:33:03,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:03,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:33:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330429979] [2025-03-04 10:33:03,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330429979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:03,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121556248] [2025-03-04 10:33:03,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:03,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:03,240 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:33:03,241 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:33:03,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:33:03,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:33:03,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:03,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:03,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:33:03,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:33:03,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121556248] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:03,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:03,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:33:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607095070] [2025-03-04 10:33:03,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:03,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:33:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:03,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:33:03,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:03,453 INFO L87 Difference]: Start difference. First operand 297 states and 422 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:33:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:03,549 INFO L93 Difference]: Finished difference Result 538 states and 854 transitions. [2025-03-04 10:33:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:33:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 50 [2025-03-04 10:33:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:03,553 INFO L225 Difference]: With dead ends: 538 [2025-03-04 10:33:03,553 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 10:33:03,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:33:03,555 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:03,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 10:33:03,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-03-04 10:33:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 428 states have (on average 1.233644859813084) internal successors, (528), 430 states have internal predecessors, (528), 91 states have call successors, (91), 8 states have call predecessors, (91), 12 states have return successors, (187), 98 states have call predecessors, (187), 91 states have call successors, (187) [2025-03-04 10:33:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 806 transitions. [2025-03-04 10:33:03,599 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 806 transitions. Word has length 50 [2025-03-04 10:33:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 806 transitions. [2025-03-04 10:33:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 22 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:33:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 806 transitions. [2025-03-04 10:33:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:33:03,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:03,602 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:03,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:33:03,806 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:33:03,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:03,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:03,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1769395424, now seen corresponding path program 1 times [2025-03-04 10:33:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487973197] [2025-03-04 10:33:03,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:03,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:33:03,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:33:03,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:03,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:33:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487973197] [2025-03-04 10:33:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487973197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819595368] [2025-03-04 10:33:03,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:03,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:03,899 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:33:03,901 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:33:03,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:33:03,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:33:03,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:03,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:03,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:03,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:33:03,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 10:33:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819595368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:04,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-03-04 10:33:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094603229] [2025-03-04 10:33:04,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:33:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:33:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:33:04,051 INFO L87 Difference]: Start difference. First operand 537 states and 806 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:33:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:04,424 INFO L93 Difference]: Finished difference Result 1084 states and 1750 transitions. [2025-03-04 10:33:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 10:33:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 58 [2025-03-04 10:33:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:04,428 INFO L225 Difference]: With dead ends: 1084 [2025-03-04 10:33:04,428 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 10:33:04,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:33:04,431 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 159 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:04,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 191 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 10:33:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 607. [2025-03-04 10:33:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 484 states have (on average 1.2396694214876034) internal successors, (600), 486 states have internal predecessors, (600), 97 states have call successors, (97), 14 states have call predecessors, (97), 20 states have return successors, (197), 106 states have call predecessors, (197), 97 states have call successors, (197) [2025-03-04 10:33:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 894 transitions. [2025-03-04 10:33:04,499 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 894 transitions. Word has length 58 [2025-03-04 10:33:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 894 transitions. [2025-03-04 10:33:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 12 states have internal predecessors, (65), 8 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 10:33:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 894 transitions. [2025-03-04 10:33:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:33:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:04,501 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:04,507 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:33:04,705 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:33:04,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:04,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1171647837, now seen corresponding path program 1 times [2025-03-04 10:33:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336220595] [2025-03-04 10:33:04,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:04,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:33:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:33:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 10:33:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336220595] [2025-03-04 10:33:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336220595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:04,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:04,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479074484] [2025-03-04 10:33:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:04,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:04,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:04,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:04,752 INFO L87 Difference]: Start difference. First operand 607 states and 894 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:04,807 INFO L93 Difference]: Finished difference Result 1098 states and 1700 transitions. [2025-03-04 10:33:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:04,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2025-03-04 10:33:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:04,811 INFO L225 Difference]: With dead ends: 1098 [2025-03-04 10:33:04,811 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 10:33:04,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:33:04,815 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:04,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 10:33:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-03-04 10:33:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 467 states have (on average 1.2312633832976445) internal successors, (575), 472 states have internal predecessors, (575), 97 states have call successors, (97), 14 states have call predecessors, (97), 17 states have return successors, (146), 100 states have call predecessors, (146), 97 states have call successors, (146) [2025-03-04 10:33:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 818 transitions. [2025-03-04 10:33:04,851 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 818 transitions. Word has length 60 [2025-03-04 10:33:04,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 818 transitions. [2025-03-04 10:33:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 818 transitions. [2025-03-04 10:33:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:33:04,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:04,853 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:04,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:33:04,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1698222933, now seen corresponding path program 2 times [2025-03-04 10:33:04,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87344067] [2025-03-04 10:33:04,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:04,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 10:33:04,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:33:04,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 10:33:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87344067] [2025-03-04 10:33:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87344067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029473056] [2025-03-04 10:33:04,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:04,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:04,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:04,895 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:33:04,897 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:33:04,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 10:33:04,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:33:04,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:04,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:04,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:33:04,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 10:33:04,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:04,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029473056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:04,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:04,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:33:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977997694] [2025-03-04 10:33:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:04,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:04,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:04,975 INFO L87 Difference]: Start difference. First operand 587 states and 818 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:05,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:05,016 INFO L93 Difference]: Finished difference Result 618 states and 905 transitions. [2025-03-04 10:33:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-03-04 10:33:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:05,020 INFO L225 Difference]: With dead ends: 618 [2025-03-04 10:33:05,020 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 10:33:05,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:05,021 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:05,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 107 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 10:33:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 605. [2025-03-04 10:33:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 481 states have (on average 1.2245322245322245) internal successors, (589), 485 states have internal predecessors, (589), 97 states have call successors, (97), 14 states have call predecessors, (97), 21 states have return successors, (189), 105 states have call predecessors, (189), 97 states have call successors, (189) [2025-03-04 10:33:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 875 transitions. [2025-03-04 10:33:05,051 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 875 transitions. Word has length 61 [2025-03-04 10:33:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 875 transitions. [2025-03-04 10:33:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 875 transitions. [2025-03-04 10:33:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:33:05,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:05,052 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:05,058 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:33:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:05,253 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1105303397, now seen corresponding path program 1 times [2025-03-04 10:33:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304401386] [2025-03-04 10:33:05,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:05,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:33:05,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:33:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 10:33:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304401386] [2025-03-04 10:33:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304401386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:33:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406266065] [2025-03-04 10:33:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:05,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:05,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:05,299 INFO L87 Difference]: Start difference. First operand 605 states and 875 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:05,352 INFO L93 Difference]: Finished difference Result 670 states and 1025 transitions. [2025-03-04 10:33:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-03-04 10:33:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:05,356 INFO L225 Difference]: With dead ends: 670 [2025-03-04 10:33:05,356 INFO L226 Difference]: Without dead ends: 669 [2025-03-04 10:33:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:05,357 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:05,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 192 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-04 10:33:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 646. [2025-03-04 10:33:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 514 states have (on average 1.215953307392996) internal successors, (625), 516 states have internal predecessors, (625), 102 states have call successors, (102), 14 states have call predecessors, (102), 24 states have return successors, (241), 115 states have call predecessors, (241), 102 states have call successors, (241) [2025-03-04 10:33:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2025-03-04 10:33:05,405 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 62 [2025-03-04 10:33:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2025-03-04 10:33:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:33:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2025-03-04 10:33:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 10:33:05,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:05,409 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:05,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:33:05,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:05,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1048851252, now seen corresponding path program 1 times [2025-03-04 10:33:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:05,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716660513] [2025-03-04 10:33:05,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:05,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:05,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:33:05,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:33:05,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 43 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 10:33:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716660513] [2025-03-04 10:33:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716660513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:05,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325118455] [2025-03-04 10:33:05,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:05,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:05,487 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:33:05,489 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:33:05,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 10:33:05,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 10:33:05,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:05,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:05,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 10:33:05,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325118455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2025-03-04 10:33:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881794355] [2025-03-04 10:33:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:33:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:05,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:33:05,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:05,565 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:33:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:05,723 INFO L93 Difference]: Finished difference Result 1296 states and 2109 transitions. [2025-03-04 10:33:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:33:05,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 96 [2025-03-04 10:33:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:05,730 INFO L225 Difference]: With dead ends: 1296 [2025-03-04 10:33:05,730 INFO L226 Difference]: Without dead ends: 744 [2025-03-04 10:33:05,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:05,734 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:05,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-04 10:33:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 737. [2025-03-04 10:33:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 588 states have (on average 1.2125850340136055) internal successors, (713), 583 states have internal predecessors, (713), 112 states have call successors, (112), 14 states have call predecessors, (112), 31 states have return successors, (280), 139 states have call predecessors, (280), 112 states have call successors, (280) [2025-03-04 10:33:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1105 transitions. [2025-03-04 10:33:05,798 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1105 transitions. Word has length 96 [2025-03-04 10:33:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:05,799 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1105 transitions. [2025-03-04 10:33:05,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 10:33:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1105 transitions. [2025-03-04 10:33:05,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:33:05,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:05,802 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:05,808 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:33:06,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,007 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash -216339047, now seen corresponding path program 1 times [2025-03-04 10:33:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086061645] [2025-03-04 10:33:06,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:06,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:33:06,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:33:06,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:06,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 31 proven. 42 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 10:33:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086061645] [2025-03-04 10:33:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086061645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979768278] [2025-03-04 10:33:06,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:06,067 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:33:06,069 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:33:06,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:33:06,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:33:06,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:06,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:33:06,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-04 10:33:06,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979768278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2025-03-04 10:33:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816946923] [2025-03-04 10:33:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:06,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:06,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:06,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:06,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:06,133 INFO L87 Difference]: Start difference. First operand 737 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:33:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:06,222 INFO L93 Difference]: Finished difference Result 1285 states and 2044 transitions. [2025-03-04 10:33:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:06,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 98 [2025-03-04 10:33:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:06,226 INFO L225 Difference]: With dead ends: 1285 [2025-03-04 10:33:06,226 INFO L226 Difference]: Without dead ends: 649 [2025-03-04 10:33:06,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 1 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:33:06,232 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:06,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-04 10:33:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2025-03-04 10:33:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 514 states have (on average 1.206225680933852) internal successors, (620), 515 states have internal predecessors, (620), 102 states have call successors, (102), 14 states have call predecessors, (102), 24 states have return successors, (205), 115 states have call predecessors, (205), 102 states have call successors, (205) [2025-03-04 10:33:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 927 transitions. [2025-03-04 10:33:06,283 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 927 transitions. Word has length 98 [2025-03-04 10:33:06,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:06,283 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 927 transitions. [2025-03-04 10:33:06,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:33:06,283 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 927 transitions. [2025-03-04 10:33:06,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 10:33:06,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:06,285 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:06,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:06,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:06,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash -573064319, now seen corresponding path program 2 times [2025-03-04 10:33:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:06,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958805711] [2025-03-04 10:33:06,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:06,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 10:33:06,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:33:06,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 10:33:06,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958805711] [2025-03-04 10:33:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958805711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:06,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628818535] [2025-03-04 10:33:06,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:06,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:06,525 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:33:06,526 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:33:06,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-04 10:33:06,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 10:33:06,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:06,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:33:06,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 10:33:06,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 10:33:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628818535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:06,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:33:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363650513] [2025-03-04 10:33:06,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:33:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:06,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:33:06,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:33:06,632 INFO L87 Difference]: Start difference. First operand 645 states and 927 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 10:33:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:06,676 INFO L93 Difference]: Finished difference Result 697 states and 1001 transitions. [2025-03-04 10:33:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 81 [2025-03-04 10:33:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:06,680 INFO L225 Difference]: With dead ends: 697 [2025-03-04 10:33:06,680 INFO L226 Difference]: Without dead ends: 696 [2025-03-04 10:33:06,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:33:06,681 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:06,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-03-04 10:33:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 665. [2025-03-04 10:33:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 529 states have (on average 1.2022684310018903) internal successors, (636), 530 states have internal predecessors, (636), 107 states have call successors, (107), 14 states have call predecessors, (107), 24 states have return successors, (218), 120 states have call predecessors, (218), 107 states have call successors, (218) [2025-03-04 10:33:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 961 transitions. [2025-03-04 10:33:06,709 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 961 transitions. Word has length 81 [2025-03-04 10:33:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:06,710 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 961 transitions. [2025-03-04 10:33:06,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 10:33:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 961 transitions. [2025-03-04 10:33:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:33:06,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:06,711 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:06,717 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:33:06,915 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:33:06,915 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash -370515923, now seen corresponding path program 1 times [2025-03-04 10:33:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897011486] [2025-03-04 10:33:06,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:06,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:33:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:33:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 10:33:06,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897011486] [2025-03-04 10:33:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897011486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924829892] [2025-03-04 10:33:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:06,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:06,997 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:33:06,999 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:33:07,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:33:07,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:33:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 137 proven. 4 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 10:33:07,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-04 10:33:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924829892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:07,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-03-04 10:33:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241608261] [2025-03-04 10:33:07,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:33:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:07,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:33:07,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:33:07,152 INFO L87 Difference]: Start difference. First operand 665 states and 961 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 7 states have internal predecessors, (61), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:33:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:07,274 INFO L93 Difference]: Finished difference Result 1287 states and 1866 transitions. [2025-03-04 10:33:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:33:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 7 states have internal predecessors, (61), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2025-03-04 10:33:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:07,278 INFO L225 Difference]: With dead ends: 1287 [2025-03-04 10:33:07,278 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 10:33:07,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:33:07,283 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:07,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 10:33:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 695. [2025-03-04 10:33:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 554 states have (on average 1.1895306859205776) internal successors, (659), 555 states have internal predecessors, (659), 109 states have call successors, (109), 19 states have call predecessors, (109), 27 states have return successors, (210), 120 states have call predecessors, (210), 109 states have call successors, (210) [2025-03-04 10:33:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 978 transitions. [2025-03-04 10:33:07,317 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 978 transitions. Word has length 97 [2025-03-04 10:33:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 978 transitions. [2025-03-04 10:33:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 7 states have internal predecessors, (61), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:33:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 978 transitions. [2025-03-04 10:33:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 10:33:07,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:07,319 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:07,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:07,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:33:07,520 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1979622294, now seen corresponding path program 3 times [2025-03-04 10:33:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096411070] [2025-03-04 10:33:07,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:07,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 11 equivalence classes. [2025-03-04 10:33:07,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:33:07,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:33:07,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:33:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096411070] [2025-03-04 10:33:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096411070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615345611] [2025-03-04 10:33:07,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:07,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:07,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:07,993 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33:07,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:33:08,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 11 equivalence classes. [2025-03-04 10:33:08,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 10:33:08,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:33:08,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:08,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:33:08,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:33:08,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:33:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615345611] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:08,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 67 [2025-03-04 10:33:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254499849] [2025-03-04 10:33:08,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 10:33:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:08,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 10:33:08,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1078, Invalid=3478, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:33:08,627 INFO L87 Difference]: Start difference. First operand 695 states and 978 transitions. Second operand has 68 states, 67 states have (on average 2.08955223880597) internal successors, (140), 68 states have internal predecessors, (140), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:33:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:09,263 INFO L93 Difference]: Finished difference Result 1177 states and 1830 transitions. [2025-03-04 10:33:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-04 10:33:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.08955223880597) internal successors, (140), 68 states have internal predecessors, (140), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Word has length 104 [2025-03-04 10:33:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:09,268 INFO L225 Difference]: With dead ends: 1177 [2025-03-04 10:33:09,268 INFO L226 Difference]: Without dead ends: 1176 [2025-03-04 10:33:09,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=6537, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 10:33:09,271 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 52 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:09,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 339 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-04 10:33:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1175. [2025-03-04 10:33:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 938 states have (on average 1.2142857142857142) internal successors, (1139), 939 states have internal predecessors, (1139), 205 states have call successors, (205), 19 states have call predecessors, (205), 27 states have return successors, (390), 216 states have call predecessors, (390), 205 states have call successors, (390) [2025-03-04 10:33:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1734 transitions. [2025-03-04 10:33:09,343 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1734 transitions. Word has length 104 [2025-03-04 10:33:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:09,343 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1734 transitions. [2025-03-04 10:33:09,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.08955223880597) internal successors, (140), 68 states have internal predecessors, (140), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 10:33:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1734 transitions. [2025-03-04 10:33:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 10:33:09,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:09,346 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 8, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:09,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:33:09,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:33:09,546 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:09,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1556174448, now seen corresponding path program 1 times [2025-03-04 10:33:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377403917] [2025-03-04 10:33:09,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:09,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 10:33:09,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 10:33:09,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:09,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 70 proven. 50 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-04 10:33:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377403917] [2025-03-04 10:33:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377403917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290760775] [2025-03-04 10:33:09,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:09,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:09,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:09,673 INFO L229 MonitoredProcess]: Starting monitored process 14 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:33:09,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:33:09,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 10:33:09,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 10:33:09,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:09,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:09,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:09,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 228 proven. 32 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-04 10:33:09,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 70 proven. 50 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-04 10:33:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290760775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:09,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-04 10:33:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976998583] [2025-03-04 10:33:09,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:09,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:33:09,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:09,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:33:09,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:09,921 INFO L87 Difference]: Start difference. First operand 1175 states and 1734 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 10:33:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:10,049 INFO L93 Difference]: Finished difference Result 2228 states and 3323 transitions. [2025-03-04 10:33:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:33:10,049 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 130 [2025-03-04 10:33:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:10,055 INFO L225 Difference]: With dead ends: 2228 [2025-03-04 10:33:10,056 INFO L226 Difference]: Without dead ends: 1261 [2025-03-04 10:33:10,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 244 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:33:10,061 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:10,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 329 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-03-04 10:33:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1248. [2025-03-04 10:33:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1000 states have (on average 1.202) internal successors, (1202), 1001 states have internal predecessors, (1202), 216 states have call successors, (216), 19 states have call predecessors, (216), 27 states have return successors, (409), 227 states have call predecessors, (409), 216 states have call successors, (409) [2025-03-04 10:33:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1827 transitions. [2025-03-04 10:33:10,128 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1827 transitions. Word has length 130 [2025-03-04 10:33:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:10,129 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1827 transitions. [2025-03-04 10:33:10,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 8 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 10:33:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1827 transitions. [2025-03-04 10:33:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 10:33:10,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:10,130 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 8, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:10,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:33:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:33:10,331 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:10,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1593689352, now seen corresponding path program 2 times [2025-03-04 10:33:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:10,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400482588] [2025-03-04 10:33:10,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:10,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-03-04 10:33:10,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 10:33:10,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 111 proven. 44 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-04 10:33:10,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400482588] [2025-03-04 10:33:10,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400482588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:10,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091519170] [2025-03-04 10:33:10,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:10,377 INFO L229 MonitoredProcess]: Starting monitored process 15 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:33:10,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:33:10,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-03-04 10:33:10,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 10:33:10,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:10,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:10,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:33:10,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 266 proven. 1 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-03-04 10:33:10,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 111 proven. 44 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-04 10:33:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091519170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:10,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-04 10:33:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103027487] [2025-03-04 10:33:10,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:10,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:10,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:10,519 INFO L87 Difference]: Start difference. First operand 1248 states and 1827 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:10,604 INFO L93 Difference]: Finished difference Result 2249 states and 3520 transitions. [2025-03-04 10:33:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 139 [2025-03-04 10:33:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:10,611 INFO L225 Difference]: With dead ends: 2249 [2025-03-04 10:33:10,611 INFO L226 Difference]: Without dead ends: 1254 [2025-03-04 10:33:10,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:10,616 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:10,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 105 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-04 10:33:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1248. [2025-03-04 10:33:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1000 states have (on average 1.202) internal successors, (1202), 1001 states have internal predecessors, (1202), 216 states have call successors, (216), 19 states have call predecessors, (216), 27 states have return successors, (407), 227 states have call predecessors, (407), 216 states have call successors, (407) [2025-03-04 10:33:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1825 transitions. [2025-03-04 10:33:10,680 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1825 transitions. Word has length 139 [2025-03-04 10:33:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:10,680 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1825 transitions. [2025-03-04 10:33:10,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:33:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1825 transitions. [2025-03-04 10:33:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:33:10,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:10,683 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:10,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:10,883 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2134210817, now seen corresponding path program 2 times [2025-03-04 10:33:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149395845] [2025-03-04 10:33:10,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:10,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-04 10:33:10,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:33:10,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:10,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-04 10:33:11,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:11,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149395845] [2025-03-04 10:33:11,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149395845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:11,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952992343] [2025-03-04 10:33:11,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:11,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:11,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:11,046 INFO L229 MonitoredProcess]: Starting monitored process 16 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:33:11,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:33:11,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-04 10:33:11,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 10:33:11,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:33:11,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 177 proven. 40 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 10:33:11,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-04 10:33:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952992343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:11,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-04 10:33:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126081390] [2025-03-04 10:33:11,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:33:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:11,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:33:11,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:33:11,347 INFO L87 Difference]: Start difference. First operand 1248 states and 1825 transitions. Second operand has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 17 states have internal predecessors, (71), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 10:33:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:11,553 INFO L93 Difference]: Finished difference Result 2222 states and 3320 transitions. [2025-03-04 10:33:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:33:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 17 states have internal predecessors, (71), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 121 [2025-03-04 10:33:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:11,561 INFO L225 Difference]: With dead ends: 2222 [2025-03-04 10:33:11,561 INFO L226 Difference]: Without dead ends: 1227 [2025-03-04 10:33:11,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 225 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:33:11,565 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:11,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 354 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-04 10:33:11,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1225. [2025-03-04 10:33:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 981 states have (on average 1.202854230377166) internal successors, (1180), 984 states have internal predecessors, (1180), 212 states have call successors, (212), 19 states have call predecessors, (212), 27 states have return successors, (398), 221 states have call predecessors, (398), 212 states have call successors, (398) [2025-03-04 10:33:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1790 transitions. [2025-03-04 10:33:11,628 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1790 transitions. Word has length 121 [2025-03-04 10:33:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:11,628 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1790 transitions. [2025-03-04 10:33:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.736842105263158) internal successors, (71), 17 states have internal predecessors, (71), 9 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 10:33:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1790 transitions. [2025-03-04 10:33:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 10:33:11,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:11,631 INFO L218 NwaCegarLoop]: trace histogram [15, 12, 8, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:11,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:33:11,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:33:11,831 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2084863558, now seen corresponding path program 1 times [2025-03-04 10:33:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184966306] [2025-03-04 10:33:11,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:11,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 10:33:11,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 10:33:11,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:11,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 88 proven. 98 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:33:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184966306] [2025-03-04 10:33:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184966306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737923274] [2025-03-04 10:33:11,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:11,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:11,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:11,935 INFO L229 MonitoredProcess]: Starting monitored process 17 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:33:11,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:33:11,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 10:33:11,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 10:33:11,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:11,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:11,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:33:11,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 269 proven. 51 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-04 10:33:12,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 88 proven. 98 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:33:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737923274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:12,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2025-03-04 10:33:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634736335] [2025-03-04 10:33:12,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:33:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:12,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:33:12,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:33:12,143 INFO L87 Difference]: Start difference. First operand 1225 states and 1790 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:33:12,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:12,396 INFO L93 Difference]: Finished difference Result 2191 states and 3269 transitions. [2025-03-04 10:33:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:33:12,396 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 141 [2025-03-04 10:33:12,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:12,402 INFO L225 Difference]: With dead ends: 2191 [2025-03-04 10:33:12,402 INFO L226 Difference]: Without dead ends: 1213 [2025-03-04 10:33:12,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:33:12,406 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:12,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 310 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-03-04 10:33:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1201. [2025-03-04 10:33:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 963 states have (on average 1.2004153686396677) internal successors, (1156), 966 states have internal predecessors, (1156), 208 states have call successors, (208), 21 states have call predecessors, (208), 25 states have return successors, (381), 213 states have call predecessors, (381), 208 states have call successors, (381) [2025-03-04 10:33:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1745 transitions. [2025-03-04 10:33:12,465 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1745 transitions. Word has length 141 [2025-03-04 10:33:12,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:12,465 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1745 transitions. [2025-03-04 10:33:12,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 6 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:33:12,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1745 transitions. [2025-03-04 10:33:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 10:33:12,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:12,467 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 9, 9, 8, 8, 8, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:12,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:33:12,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:33:12,671 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:12,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1748067769, now seen corresponding path program 1 times [2025-03-04 10:33:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:12,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047189091] [2025-03-04 10:33:12,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:12,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 10:33:12,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 10:33:12,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:12,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 159 proven. 29 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-04 10:33:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047189091] [2025-03-04 10:33:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047189091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908966028] [2025-03-04 10:33:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:12,732 INFO L229 MonitoredProcess]: Starting monitored process 18 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:33:12,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:33:12,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 10:33:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 10:33:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:12,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:12,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 10:33:12,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:33:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908966028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:33:12,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2025-03-04 10:33:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517422411] [2025-03-04 10:33:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:33:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:12,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:33:12,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:12,824 INFO L87 Difference]: Start difference. First operand 1201 states and 1745 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:33:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:12,906 INFO L93 Difference]: Finished difference Result 1686 states and 2523 transitions. [2025-03-04 10:33:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:33:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 144 [2025-03-04 10:33:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:12,911 INFO L225 Difference]: With dead ends: 1686 [2025-03-04 10:33:12,913 INFO L226 Difference]: Without dead ends: 836 [2025-03-04 10:33:12,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:12,917 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:12,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 149 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-04 10:33:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 831. [2025-03-04 10:33:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 666 states have (on average 1.1846846846846846) internal successors, (789), 672 states have internal predecessors, (789), 139 states have call successors, (139), 17 states have call predecessors, (139), 21 states have return successors, (212), 141 states have call predecessors, (212), 139 states have call successors, (212) [2025-03-04 10:33:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1140 transitions. [2025-03-04 10:33:12,954 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1140 transitions. Word has length 144 [2025-03-04 10:33:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1140 transitions. [2025-03-04 10:33:12,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:33:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1140 transitions. [2025-03-04 10:33:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 10:33:12,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:12,958 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 10, 9, 9, 8, 8, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:33:13,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:33:13,158 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:13,159 INFO L85 PathProgramCache]: Analyzing trace with hash -591910066, now seen corresponding path program 1 times [2025-03-04 10:33:13,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:13,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298347092] [2025-03-04 10:33:13,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:33:13,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:33:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:13,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 61 proven. 137 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-04 10:33:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298347092] [2025-03-04 10:33:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298347092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875927524] [2025-03-04 10:33:13,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:13,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:13,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:13,266 INFO L229 MonitoredProcess]: Starting monitored process 19 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:33:13,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:33:13,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:33:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:33:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:13,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:33:13,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 367 proven. 10 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-04 10:33:13,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 261 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-03-04 10:33:13,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875927524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:13,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 27 [2025-03-04 10:33:13,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194573008] [2025-03-04 10:33:13,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:33:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:13,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:33:13,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:13,833 INFO L87 Difference]: Start difference. First operand 831 states and 1140 transitions. Second operand has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 15 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (18), 11 states have call predecessors, (18), 15 states have call successors, (18) [2025-03-04 10:33:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:14,415 INFO L93 Difference]: Finished difference Result 1465 states and 2271 transitions. [2025-03-04 10:33:14,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:33:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 15 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (18), 11 states have call predecessors, (18), 15 states have call successors, (18) Word has length 174 [2025-03-04 10:33:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:14,421 INFO L225 Difference]: With dead ends: 1465 [2025-03-04 10:33:14,421 INFO L226 Difference]: Without dead ends: 1000 [2025-03-04 10:33:14,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 327 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 10:33:14,425 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 214 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:14,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 371 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-03-04 10:33:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 951. [2025-03-04 10:33:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 763 states have (on average 1.1795543905635648) internal successors, (900), 765 states have internal predecessors, (900), 153 states have call successors, (153), 23 states have call predecessors, (153), 30 states have return successors, (350), 162 states have call predecessors, (350), 153 states have call successors, (350) [2025-03-04 10:33:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1403 transitions. [2025-03-04 10:33:14,474 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1403 transitions. Word has length 174 [2025-03-04 10:33:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:14,475 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1403 transitions. [2025-03-04 10:33:14,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.407407407407407) internal successors, (119), 26 states have internal predecessors, (119), 15 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (18), 11 states have call predecessors, (18), 15 states have call successors, (18) [2025-03-04 10:33:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1403 transitions. [2025-03-04 10:33:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-04 10:33:14,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:14,477 INFO L218 NwaCegarLoop]: trace histogram [22, 20, 15, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:14,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:33:14,677 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1091666690, now seen corresponding path program 2 times [2025-03-04 10:33:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729669238] [2025-03-04 10:33:14,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:14,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 223 statements into 2 equivalence classes. [2025-03-04 10:33:14,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 10:33:14,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:14,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 425 proven. 178 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2025-03-04 10:33:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729669238] [2025-03-04 10:33:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729669238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:14,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612896759] [2025-03-04 10:33:14,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:14,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:14,982 INFO L229 MonitoredProcess]: Starting monitored process 20 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:33:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:33:15,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 223 statements into 2 equivalence classes. [2025-03-04 10:33:15,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 10:33:15,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:15,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:33:15,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 517 proven. 140 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2025-03-04 10:33:15,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 441 proven. 161 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2025-03-04 10:33:15,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612896759] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:15,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:15,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15] total 24 [2025-03-04 10:33:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953858060] [2025-03-04 10:33:15,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:15,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:15,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:15,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:15,595 INFO L87 Difference]: Start difference. First operand 951 states and 1403 transitions. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 16 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (22), 11 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-04 10:33:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:16,247 INFO L93 Difference]: Finished difference Result 2096 states and 4093 transitions. [2025-03-04 10:33:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:33:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 16 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (22), 11 states have call predecessors, (22), 16 states have call successors, (22) Word has length 223 [2025-03-04 10:33:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:16,255 INFO L225 Difference]: With dead ends: 2096 [2025-03-04 10:33:16,256 INFO L226 Difference]: Without dead ends: 1169 [2025-03-04 10:33:16,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 440 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:33:16,263 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:16,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 394 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-04 10:33:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1115. [2025-03-04 10:33:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 892 states have (on average 1.1849775784753362) internal successors, (1057), 887 states have internal predecessors, (1057), 173 states have call successors, (173), 28 states have call predecessors, (173), 45 states have return successors, (784), 199 states have call predecessors, (784), 173 states have call successors, (784) [2025-03-04 10:33:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 2014 transitions. [2025-03-04 10:33:16,340 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 2014 transitions. Word has length 223 [2025-03-04 10:33:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:16,340 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 2014 transitions. [2025-03-04 10:33:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 16 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (22), 11 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-04 10:33:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 2014 transitions. [2025-03-04 10:33:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:33:16,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:16,343 INFO L218 NwaCegarLoop]: trace histogram [20, 18, 13, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:16,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:16,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:16,544 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -487411096, now seen corresponding path program 3 times [2025-03-04 10:33:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576274548] [2025-03-04 10:33:16,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:16,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 9 equivalence classes. [2025-03-04 10:33:16,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 76 of 202 statements. [2025-03-04 10:33:16,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:33:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 289 proven. 40 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-03-04 10:33:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576274548] [2025-03-04 10:33:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576274548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:16,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94697842] [2025-03-04 10:33:16,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:16,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:16,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:16,654 INFO L229 MonitoredProcess]: Starting monitored process 21 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:33:16,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:33:16,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 202 statements into 9 equivalence classes. [2025-03-04 10:33:16,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 76 of 202 statements. [2025-03-04 10:33:16,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:33:16,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:16,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:16,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 136 proven. 12 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-04 10:33:16,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 136 proven. 12 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-04 10:33:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94697842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:17,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:17,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2025-03-04 10:33:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361534049] [2025-03-04 10:33:17,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:17,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:33:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:17,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:33:17,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:33:17,005 INFO L87 Difference]: Start difference. First operand 1115 states and 2014 transitions. Second operand has 18 states, 15 states have (on average 6.6) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 10:33:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:17,382 INFO L93 Difference]: Finished difference Result 2693 states and 7448 transitions. [2025-03-04 10:33:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:33:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 6.6) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) Word has length 202 [2025-03-04 10:33:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:17,399 INFO L225 Difference]: With dead ends: 2693 [2025-03-04 10:33:17,399 INFO L226 Difference]: Without dead ends: 1957 [2025-03-04 10:33:17,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:33:17,412 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 163 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:17,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 237 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2025-03-04 10:33:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1829. [2025-03-04 10:33:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1451 states have (on average 1.1929703652653343) internal successors, (1731), 1448 states have internal predecessors, (1731), 280 states have call successors, (280), 45 states have call predecessors, (280), 93 states have return successors, (2660), 335 states have call predecessors, (2660), 280 states have call successors, (2660) [2025-03-04 10:33:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 4671 transitions. [2025-03-04 10:33:17,568 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 4671 transitions. Word has length 202 [2025-03-04 10:33:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:17,569 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 4671 transitions. [2025-03-04 10:33:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 6.6) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-04 10:33:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 4671 transitions. [2025-03-04 10:33:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-04 10:33:17,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:17,571 INFO L218 NwaCegarLoop]: trace histogram [21, 18, 14, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:17,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:17,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 10:33:17,776 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1930388293, now seen corresponding path program 4 times [2025-03-04 10:33:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5878125] [2025-03-04 10:33:17,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:17,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:17,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-03-04 10:33:17,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 136 of 207 statements. [2025-03-04 10:33:17,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-04 10:33:17,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5878125] [2025-03-04 10:33:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5878125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:17,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082906104] [2025-03-04 10:33:17,832 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:17,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:17,834 INFO L229 MonitoredProcess]: Starting monitored process 22 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:33:17,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:33:17,866 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 207 statements into 2 equivalence classes. [2025-03-04 10:33:17,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 136 of 207 statements. [2025-03-04 10:33:17,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:17,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:17,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:33:17,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 223 proven. 2 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-04 10:33:17,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-04 10:33:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082906104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:17,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-04 10:33:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240261850] [2025-03-04 10:33:17,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:17,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:17,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:17,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:17,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:17,996 INFO L87 Difference]: Start difference. First operand 1829 states and 4671 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:18,149 INFO L93 Difference]: Finished difference Result 3219 states and 9763 transitions. [2025-03-04 10:33:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:33:18,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 207 [2025-03-04 10:33:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:18,190 INFO L225 Difference]: With dead ends: 3219 [2025-03-04 10:33:18,190 INFO L226 Difference]: Without dead ends: 1799 [2025-03-04 10:33:18,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 412 SyntacticMatches, 3 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:33:18,201 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:18,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 203 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-03-04 10:33:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1620. [2025-03-04 10:33:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1288 states have (on average 1.184782608695652) internal successors, (1526), 1286 states have internal predecessors, (1526), 258 states have call successors, (258), 45 states have call predecessors, (258), 69 states have return successors, (1502), 288 states have call predecessors, (1502), 258 states have call successors, (1502) [2025-03-04 10:33:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 3286 transitions. [2025-03-04 10:33:18,326 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 3286 transitions. Word has length 207 [2025-03-04 10:33:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:18,327 INFO L471 AbstractCegarLoop]: Abstraction has 1620 states and 3286 transitions. [2025-03-04 10:33:18,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:33:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 3286 transitions. [2025-03-04 10:33:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-04 10:33:18,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:18,329 INFO L218 NwaCegarLoop]: trace histogram [21, 18, 14, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:18,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:18,530 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:18,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1631244453, now seen corresponding path program 5 times [2025-03-04 10:33:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:18,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192395017] [2025-03-04 10:33:18,531 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:18,536 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 207 statements into 9 equivalence classes. [2025-03-04 10:33:18,563 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 207 of 207 statements. [2025-03-04 10:33:18,563 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 10:33:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 432 proven. 97 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-03-04 10:33:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192395017] [2025-03-04 10:33:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192395017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664368196] [2025-03-04 10:33:18,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:18,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:18,854 INFO L229 MonitoredProcess]: Starting monitored process 23 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:33:18,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:33:18,886 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 207 statements into 9 equivalence classes. [2025-03-04 10:33:18,920 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 207 of 207 statements. [2025-03-04 10:33:18,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-04 10:33:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:18,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:18,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2025-03-04 10:33:18,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2025-03-04 10:33:19,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664368196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:19,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 25 [2025-03-04 10:33:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097922947] [2025-03-04 10:33:19,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:33:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:19,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:33:19,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:33:19,133 INFO L87 Difference]: Start difference. First operand 1620 states and 3286 transitions. Second operand has 25 states, 23 states have (on average 4.956521739130435) internal successors, (114), 21 states have internal predecessors, (114), 14 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 10:33:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:20,643 INFO L93 Difference]: Finished difference Result 4435 states and 14350 transitions. [2025-03-04 10:33:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 10:33:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.956521739130435) internal successors, (114), 21 states have internal predecessors, (114), 14 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 207 [2025-03-04 10:33:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:20,669 INFO L225 Difference]: With dead ends: 4435 [2025-03-04 10:33:20,669 INFO L226 Difference]: Without dead ends: 3198 [2025-03-04 10:33:20,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1230, Invalid=4320, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 10:33:20,688 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 814 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:20,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 553 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:33:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2025-03-04 10:33:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 2976. [2025-03-04 10:33:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2359 states have (on average 1.1865197117422637) internal successors, (2799), 2360 states have internal predecessors, (2799), 441 states have call successors, (441), 90 states have call predecessors, (441), 171 states have return successors, (4913), 525 states have call predecessors, (4913), 441 states have call successors, (4913) [2025-03-04 10:33:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 8153 transitions. [2025-03-04 10:33:21,008 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 8153 transitions. Word has length 207 [2025-03-04 10:33:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:21,008 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 8153 transitions. [2025-03-04 10:33:21,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.956521739130435) internal successors, (114), 21 states have internal predecessors, (114), 14 states have call successors, (18), 8 states have call predecessors, (18), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 10:33:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 8153 transitions. [2025-03-04 10:33:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-04 10:33:21,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:21,011 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 16, 9, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:21,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:21,212 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:21,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1388168184, now seen corresponding path program 3 times [2025-03-04 10:33:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:21,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940749124] [2025-03-04 10:33:21,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:21,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 240 statements into 9 equivalence classes. [2025-03-04 10:33:21,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 193 of 240 statements. [2025-03-04 10:33:21,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:21,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2025-03-04 10:33:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940749124] [2025-03-04 10:33:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940749124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087610041] [2025-03-04 10:33:21,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:21,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:21,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:21,287 INFO L229 MonitoredProcess]: Starting monitored process 24 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:33:21,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:33:21,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 240 statements into 9 equivalence classes. [2025-03-04 10:33:21,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 193 of 240 statements. [2025-03-04 10:33:21,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:21,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:33:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2025-03-04 10:33:21,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2025-03-04 10:33:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087610041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:21,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-04 10:33:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515010129] [2025-03-04 10:33:21,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:21,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:33:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:21,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:33:21,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:33:21,512 INFO L87 Difference]: Start difference. First operand 2976 states and 8153 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:33:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:21,744 INFO L93 Difference]: Finished difference Result 5656 states and 19820 transitions. [2025-03-04 10:33:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 240 [2025-03-04 10:33:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:21,768 INFO L225 Difference]: With dead ends: 5656 [2025-03-04 10:33:21,768 INFO L226 Difference]: Without dead ends: 3062 [2025-03-04 10:33:21,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:33:21,795 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:21,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 65 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-04 10:33:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3033. [2025-03-04 10:33:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2411 states have (on average 1.1920364993778516) internal successors, (2874), 2406 states have internal predecessors, (2874), 441 states have call successors, (441), 90 states have call predecessors, (441), 176 states have return successors, (5727), 536 states have call predecessors, (5727), 437 states have call successors, (5727) [2025-03-04 10:33:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 9042 transitions. [2025-03-04 10:33:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 9042 transitions. Word has length 240 [2025-03-04 10:33:22,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:22,102 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 9042 transitions. [2025-03-04 10:33:22,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:33:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 9042 transitions. [2025-03-04 10:33:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-04 10:33:22,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:22,106 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 15, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:22,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:22,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:22,310 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:22,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash -812605861, now seen corresponding path program 4 times [2025-03-04 10:33:22,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491445658] [2025-03-04 10:33:22,311 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:22,316 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 232 statements into 2 equivalence classes. [2025-03-04 10:33:22,327 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 151 of 232 statements. [2025-03-04 10:33:22,327 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 124 proven. 13 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-03-04 10:33:22,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491445658] [2025-03-04 10:33:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491445658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:22,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183932665] [2025-03-04 10:33:22,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:22,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:22,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:22,381 INFO L229 MonitoredProcess]: Starting monitored process 25 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:33:22,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:33:22,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 232 statements into 2 equivalence classes. [2025-03-04 10:33:22,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 151 of 232 statements. [2025-03-04 10:33:22,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:22,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:22,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:33:22,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 124 proven. 13 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-03-04 10:33:22,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 124 proven. 13 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2025-03-04 10:33:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183932665] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:22,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 10:33:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201125359] [2025-03-04 10:33:22,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:22,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:33:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:22,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:33:22,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:33:22,672 INFO L87 Difference]: Start difference. First operand 3033 states and 9042 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:33:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:22,931 INFO L93 Difference]: Finished difference Result 5535 states and 18972 transitions. [2025-03-04 10:33:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 232 [2025-03-04 10:33:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:22,951 INFO L225 Difference]: With dead ends: 5535 [2025-03-04 10:33:22,951 INFO L226 Difference]: Without dead ends: 2916 [2025-03-04 10:33:22,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:33:22,977 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:22,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 92 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2025-03-04 10:33:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2865. [2025-03-04 10:33:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2289 states have (on average 1.1887287024901705) internal successors, (2721), 2280 states have internal predecessors, (2721), 425 states have call successors, (425), 90 states have call predecessors, (425), 146 states have return successors, (4224), 494 states have call predecessors, (4224), 421 states have call successors, (4224) [2025-03-04 10:33:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 7370 transitions. [2025-03-04 10:33:23,248 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 7370 transitions. Word has length 232 [2025-03-04 10:33:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:23,250 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 7370 transitions. [2025-03-04 10:33:23,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:33:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 7370 transitions. [2025-03-04 10:33:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-04 10:33:23,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:23,253 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 14, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:23,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:23,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:23,454 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:23,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1821498856, now seen corresponding path program 5 times [2025-03-04 10:33:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794290331] [2025-03-04 10:33:23,455 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:23,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 224 statements into 9 equivalence classes. [2025-03-04 10:33:23,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 209 of 224 statements. [2025-03-04 10:33:23,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 10:33:23,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 213 proven. 15 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2025-03-04 10:33:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794290331] [2025-03-04 10:33:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794290331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588540037] [2025-03-04 10:33:23,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:23,619 INFO L229 MonitoredProcess]: Starting monitored process 26 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:33:23,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:33:23,657 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 224 statements into 9 equivalence classes. [2025-03-04 10:33:23,699 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 209 of 224 statements. [2025-03-04 10:33:23,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-04 10:33:23,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:23,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:33:23,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 213 proven. 15 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2025-03-04 10:33:23,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1324 backedges. 213 proven. 15 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2025-03-04 10:33:23,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588540037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:23,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:23,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2025-03-04 10:33:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941680698] [2025-03-04 10:33:23,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:23,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:33:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:23,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:33:23,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:33:23,952 INFO L87 Difference]: Start difference. First operand 2865 states and 7370 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 10:33:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:24,241 INFO L93 Difference]: Finished difference Result 5160 states and 17007 transitions. [2025-03-04 10:33:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:33:24,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 224 [2025-03-04 10:33:24,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:24,262 INFO L225 Difference]: With dead ends: 5160 [2025-03-04 10:33:24,262 INFO L226 Difference]: Without dead ends: 2640 [2025-03-04 10:33:24,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 444 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:33:24,288 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:24,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 135 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2025-03-04 10:33:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2608. [2025-03-04 10:33:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2076 states have (on average 1.1950867052023122) internal successors, (2481), 2087 states have internal predecessors, (2481), 399 states have call successors, (399), 83 states have call predecessors, (399), 128 states have return successors, (3684), 437 states have call predecessors, (3684), 395 states have call successors, (3684) [2025-03-04 10:33:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 6564 transitions. [2025-03-04 10:33:24,522 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 6564 transitions. Word has length 224 [2025-03-04 10:33:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:24,523 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 6564 transitions. [2025-03-04 10:33:24,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 7 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-04 10:33:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 6564 transitions. [2025-03-04 10:33:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 10:33:24,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:24,526 INFO L218 NwaCegarLoop]: trace histogram [25, 23, 17, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:24,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:33:24,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:33:24,726 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:24,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -664049878, now seen corresponding path program 6 times [2025-03-04 10:33:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:24,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335400090] [2025-03-04 10:33:24,727 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:24,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:24,733 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 252 statements into 9 equivalence classes. [2025-03-04 10:33:24,759 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 205 of 252 statements. [2025-03-04 10:33:24,759 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 10:33:24,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 298 proven. 51 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-04 10:33:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335400090] [2025-03-04 10:33:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335400090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120400285] [2025-03-04 10:33:24,989 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:24,990 INFO L229 MonitoredProcess]: Starting monitored process 27 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:33:24,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:33:25,034 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 252 statements into 9 equivalence classes. [2025-03-04 10:33:25,074 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 205 of 252 statements. [2025-03-04 10:33:25,074 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 10:33:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:25,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:33:25,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 298 proven. 12 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-03-04 10:33:25,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 312 proven. 12 refuted. 0 times theorem prover too weak. 1365 trivial. 0 not checked. [2025-03-04 10:33:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120400285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:25,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 15 [2025-03-04 10:33:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263054954] [2025-03-04 10:33:25,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:33:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:25,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:33:25,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:33:25,495 INFO L87 Difference]: Start difference. First operand 2608 states and 6564 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (13), 10 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 10:33:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:25,676 INFO L93 Difference]: Finished difference Result 2735 states and 7031 transitions. [2025-03-04 10:33:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:33:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (13), 10 states have call predecessors, (13), 4 states have call successors, (13) Word has length 252 [2025-03-04 10:33:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:25,696 INFO L225 Difference]: With dead ends: 2735 [2025-03-04 10:33:25,696 INFO L226 Difference]: Without dead ends: 2726 [2025-03-04 10:33:25,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 497 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:33:25,700 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:25,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 262 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2025-03-04 10:33:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2676. [2025-03-04 10:33:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2137 states have (on average 1.1890500701918578) internal successors, (2541), 2134 states have internal predecessors, (2541), 404 states have call successors, (404), 83 states have call predecessors, (404), 130 states have return successors, (3827), 458 states have call predecessors, (3827), 400 states have call successors, (3827) [2025-03-04 10:33:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 6772 transitions. [2025-03-04 10:33:25,896 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 6772 transitions. Word has length 252 [2025-03-04 10:33:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:25,897 INFO L471 AbstractCegarLoop]: Abstraction has 2676 states and 6772 transitions. [2025-03-04 10:33:25,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (13), 10 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-04 10:33:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 6772 transitions. [2025-03-04 10:33:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-04 10:33:25,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:25,899 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:25,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:33:26,100 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:26,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 548621718, now seen corresponding path program 4 times [2025-03-04 10:33:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:26,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115528562] [2025-03-04 10:33:26,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:26,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 212 statements into 2 equivalence classes. [2025-03-04 10:33:26,123 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 10:33:26,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:26,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 10:33:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115528562] [2025-03-04 10:33:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115528562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749716974] [2025-03-04 10:33:26,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:26,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:26,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:26,959 INFO L229 MonitoredProcess]: Starting monitored process 28 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:33:26,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:33:26,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 212 statements into 2 equivalence classes. [2025-03-04 10:33:27,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 10:33:27,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:33:27,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:27,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:33:27,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 10:33:27,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 10:33:28,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749716974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:28,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:28,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2025-03-04 10:33:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028044245] [2025-03-04 10:33:28,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:28,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-03-04 10:33:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:28,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-03-04 10:33:28,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2025-03-04 10:33:28,470 INFO L87 Difference]: Start difference. First operand 2676 states and 6772 transitions. Second operand has 94 states, 93 states have (on average 2.075268817204301) internal successors, (193), 94 states have internal predecessors, (193), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:33:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:29,025 INFO L93 Difference]: Finished difference Result 4132 states and 12283 transitions. [2025-03-04 10:33:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-03-04 10:33:29,026 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 2.075268817204301) internal successors, (193), 94 states have internal predecessors, (193), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Word has length 212 [2025-03-04 10:33:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:29,060 INFO L225 Difference]: With dead ends: 4132 [2025-03-04 10:33:29,060 INFO L226 Difference]: Without dead ends: 4131 [2025-03-04 10:33:29,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2025-03-04 10:33:29,070 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:29,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-03-04 10:33:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4116. [2025-03-04 10:33:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 3289 states have (on average 1.210398297354819) internal successors, (3981), 3286 states have internal predecessors, (3981), 692 states have call successors, (692), 83 states have call predecessors, (692), 130 states have return successors, (7427), 746 states have call predecessors, (7427), 688 states have call successors, (7427) [2025-03-04 10:33:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 12100 transitions. [2025-03-04 10:33:29,493 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 12100 transitions. Word has length 212 [2025-03-04 10:33:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:29,493 INFO L471 AbstractCegarLoop]: Abstraction has 4116 states and 12100 transitions. [2025-03-04 10:33:29,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 2.075268817204301) internal successors, (193), 94 states have internal predecessors, (193), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 10:33:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 12100 transitions. [2025-03-04 10:33:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 10:33:29,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:29,497 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 20, 12, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-04 10:33:29,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-04 10:33:29,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:33:29,701 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -819791922, now seen corresponding path program 1 times [2025-03-04 10:33:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910231294] [2025-03-04 10:33:29,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 10:33:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 10:33:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 171 proven. 34 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2025-03-04 10:33:29,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:29,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910231294] [2025-03-04 10:33:29,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910231294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:29,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985221218] [2025-03-04 10:33:29,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:29,895 INFO L229 MonitoredProcess]: Starting monitored process 29 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:33:29,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:33:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 10:33:29,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 10:33:29,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:29,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 781 proven. 32 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:33:30,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2113 backedges. 171 proven. 34 refuted. 0 times theorem prover too weak. 1908 trivial. 0 not checked. [2025-03-04 10:33:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985221218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:30,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2025-03-04 10:33:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838103381] [2025-03-04 10:33:30,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:33:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:33:30,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:33:30,267 INFO L87 Difference]: Start difference. First operand 4116 states and 12100 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 10:33:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:30,542 INFO L93 Difference]: Finished difference Result 4267 states and 12261 transitions. [2025-03-04 10:33:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:33:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 286 [2025-03-04 10:33:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:30,573 INFO L225 Difference]: With dead ends: 4267 [2025-03-04 10:33:30,573 INFO L226 Difference]: Without dead ends: 4103 [2025-03-04 10:33:30,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 553 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:33:30,582 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:30,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 388 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-03-04 10:33:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4102. [2025-03-04 10:33:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 3277 states have (on average 1.210863594751297) internal successors, (3968), 3274 states have internal predecessors, (3968), 690 states have call successors, (690), 83 states have call predecessors, (690), 130 states have return successors, (7425), 744 states have call predecessors, (7425), 686 states have call successors, (7425) [2025-03-04 10:33:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 12083 transitions. [2025-03-04 10:33:30,906 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 12083 transitions. Word has length 286 [2025-03-04 10:33:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 12083 transitions. [2025-03-04 10:33:30,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 10:33:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 12083 transitions. [2025-03-04 10:33:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 10:33:30,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:30,909 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 20, 12, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2025-03-04 10:33:30,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:31,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:33:31,110 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1369703006, now seen corresponding path program 2 times [2025-03-04 10:33:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528973838] [2025-03-04 10:33:31,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:31,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:31,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-03-04 10:33:31,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 10:33:31,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:31,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 158 proven. 138 refuted. 0 times theorem prover too weak. 1976 trivial. 0 not checked. [2025-03-04 10:33:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528973838] [2025-03-04 10:33:31,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528973838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:31,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724568101] [2025-03-04 10:33:31,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:31,285 INFO L229 MonitoredProcess]: Starting monitored process 30 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:33:31,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:33:31,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-03-04 10:33:31,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 10:33:31,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:31,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:31,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:33:31,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 4 proven. 245 refuted. 0 times theorem prover too weak. 2023 trivial. 0 not checked. [2025-03-04 10:33:31,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 4 proven. 245 refuted. 0 times theorem prover too weak. 2023 trivial. 0 not checked. [2025-03-04 10:33:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724568101] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:31,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2025-03-04 10:33:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360631214] [2025-03-04 10:33:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:33:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:31,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:33:31,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:33:31,689 INFO L87 Difference]: Start difference. First operand 4102 states and 12083 transitions. Second operand has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 25 states have internal predecessors, (104), 13 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 10:33:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:32,714 INFO L93 Difference]: Finished difference Result 6637 states and 21748 transitions. [2025-03-04 10:33:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 10:33:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 25 states have internal predecessors, (104), 13 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) Word has length 295 [2025-03-04 10:33:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:32,769 INFO L225 Difference]: With dead ends: 6637 [2025-03-04 10:33:32,769 INFO L226 Difference]: Without dead ends: 6575 [2025-03-04 10:33:32,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1163, Invalid=7027, Unknown=0, NotChecked=0, Total=8190 [2025-03-04 10:33:32,785 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:32,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 404 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:32,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2025-03-04 10:33:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 1595. [2025-03-04 10:33:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1269 states have (on average 1.1576044129235619) internal successors, (1469), 1266 states have internal predecessors, (1469), 196 states have call successors, (196), 79 states have call predecessors, (196), 126 states have return successors, (868), 249 states have call predecessors, (868), 192 states have call successors, (868) [2025-03-04 10:33:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2533 transitions. [2025-03-04 10:33:33,793 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2533 transitions. Word has length 295 [2025-03-04 10:33:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2533 transitions. [2025-03-04 10:33:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.333333333333333) internal successors, (104), 25 states have internal predecessors, (104), 13 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-04 10:33:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2533 transitions. [2025-03-04 10:33:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-04 10:33:33,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:33,796 INFO L218 NwaCegarLoop]: trace histogram [28, 27, 20, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:33,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-04 10:33:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:33:33,997 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:33,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -254904346, now seen corresponding path program 7 times [2025-03-04 10:33:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144916955] [2025-03-04 10:33:33,998 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 10:33:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 10:33:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 271 proven. 209 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2025-03-04 10:33:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144916955] [2025-03-04 10:33:34,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144916955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:34,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091499217] [2025-03-04 10:33:34,206 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:34,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:34,208 INFO L229 MonitoredProcess]: Starting monitored process 31 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:33:34,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:33:34,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-04 10:33:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-04 10:33:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:34,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:33:34,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 396 proven. 202 refuted. 0 times theorem prover too weak. 1635 trivial. 0 not checked. [2025-03-04 10:33:34,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 271 proven. 209 refuted. 0 times theorem prover too weak. 1753 trivial. 0 not checked. [2025-03-04 10:33:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091499217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:34,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 24 [2025-03-04 10:33:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292882082] [2025-03-04 10:33:34,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:34,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:34,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:34,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:34,687 INFO L87 Difference]: Start difference. First operand 1595 states and 2533 transitions. Second operand has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 22 states have internal predecessors, (94), 13 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 10:33:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:35,173 INFO L93 Difference]: Finished difference Result 2893 states and 4708 transitions. [2025-03-04 10:33:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:33:35,173 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 22 states have internal predecessors, (94), 13 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) Word has length 287 [2025-03-04 10:33:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:35,180 INFO L225 Difference]: With dead ends: 2893 [2025-03-04 10:33:35,180 INFO L226 Difference]: Without dead ends: 1636 [2025-03-04 10:33:35,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 557 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:33:35,184 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:35,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 419 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-03-04 10:33:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1615. [2025-03-04 10:33:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1284 states have (on average 1.1534267912772587) internal successors, (1481), 1283 states have internal predecessors, (1481), 199 states have call successors, (199), 81 states have call predecessors, (199), 128 states have return successors, (865), 250 states have call predecessors, (865), 195 states have call successors, (865) [2025-03-04 10:33:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2545 transitions. [2025-03-04 10:33:35,284 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2545 transitions. Word has length 287 [2025-03-04 10:33:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:35,285 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2545 transitions. [2025-03-04 10:33:35,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 22 states have internal predecessors, (94), 13 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (15), 9 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 10:33:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2545 transitions. [2025-03-04 10:33:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 10:33:35,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:35,287 INFO L218 NwaCegarLoop]: trace histogram [34, 28, 24, 15, 12, 12, 12, 12, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:35,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:33:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-04 10:33:35,488 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1195140916, now seen corresponding path program 8 times [2025-03-04 10:33:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136859423] [2025-03-04 10:33:35,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:35,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-04 10:33:35,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 10:33:35,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:35,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 473 proven. 385 refuted. 0 times theorem prover too weak. 2070 trivial. 0 not checked. [2025-03-04 10:33:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136859423] [2025-03-04 10:33:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136859423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632537548] [2025-03-04 10:33:35,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:35,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:35,886 INFO L229 MonitoredProcess]: Starting monitored process 32 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:33:35,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:33:35,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-04 10:33:35,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 10:33:35,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:35,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:35,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:33:35,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1587 proven. 9 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2025-03-04 10:33:36,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 489 proven. 359 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2025-03-04 10:33:36,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632537548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:36,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:36,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 31 [2025-03-04 10:33:36,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109910661] [2025-03-04 10:33:36,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:36,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:33:36,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:36,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:33:36,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:33:36,460 INFO L87 Difference]: Start difference. First operand 1615 states and 2545 transitions. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 29 states have internal predecessors, (111), 14 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-04 10:33:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:37,508 INFO L93 Difference]: Finished difference Result 3999 states and 6726 transitions. [2025-03-04 10:33:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-04 10:33:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 29 states have internal predecessors, (111), 14 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) Word has length 325 [2025-03-04 10:33:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:37,519 INFO L225 Difference]: With dead ends: 3999 [2025-03-04 10:33:37,520 INFO L226 Difference]: Without dead ends: 2736 [2025-03-04 10:33:37,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 631 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2403 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1084, Invalid=6056, Unknown=0, NotChecked=0, Total=7140 [2025-03-04 10:33:37,526 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 101 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:37,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 461 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:37,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-04 10:33:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2492. [2025-03-04 10:33:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 1999 states have (on average 1.129064532266133) internal successors, (2257), 1972 states have internal predecessors, (2257), 314 states have call successors, (314), 103 states have call predecessors, (314), 175 states have return successors, (1404), 416 states have call predecessors, (1404), 314 states have call successors, (1404) [2025-03-04 10:33:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3975 transitions. [2025-03-04 10:33:37,820 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3975 transitions. Word has length 325 [2025-03-04 10:33:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:37,820 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 3975 transitions. [2025-03-04 10:33:37,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 29 states have internal predecessors, (111), 14 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-04 10:33:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3975 transitions. [2025-03-04 10:33:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-04 10:33:37,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:37,824 INFO L218 NwaCegarLoop]: trace histogram [37, 35, 25, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:37,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:38,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:38,024 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:38,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1660615310, now seen corresponding path program 9 times [2025-03-04 10:33:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:38,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376181975] [2025-03-04 10:33:38,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:38,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 373 statements into 10 equivalence classes. [2025-03-04 10:33:38,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 273 of 373 statements. [2025-03-04 10:33:38,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3882 backedges. 531 proven. 573 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-04 10:33:38,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376181975] [2025-03-04 10:33:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376181975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:38,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105611584] [2025-03-04 10:33:38,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:38,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:38,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:38,397 INFO L229 MonitoredProcess]: Starting monitored process 33 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:33:38,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:33:38,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 373 statements into 10 equivalence classes. [2025-03-04 10:33:38,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 273 of 373 statements. [2025-03-04 10:33:38,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-04 10:33:38,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:38,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:33:38,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3882 backedges. 1955 proven. 241 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2025-03-04 10:33:38,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3882 backedges. 512 proven. 504 refuted. 0 times theorem prover too weak. 2866 trivial. 0 not checked. [2025-03-04 10:33:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105611584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:39,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 36 [2025-03-04 10:33:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834099697] [2025-03-04 10:33:39,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:33:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:39,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:33:39,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:33:39,106 INFO L87 Difference]: Start difference. First operand 2492 states and 3975 transitions. Second operand has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 34 states have internal predecessors, (140), 16 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 14 states have call predecessors, (23), 14 states have call successors, (23) [2025-03-04 10:33:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:40,343 INFO L93 Difference]: Finished difference Result 4965 states and 8562 transitions. [2025-03-04 10:33:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-04 10:33:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 34 states have internal predecessors, (140), 16 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 14 states have call predecessors, (23), 14 states have call successors, (23) Word has length 373 [2025-03-04 10:33:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:40,353 INFO L225 Difference]: With dead ends: 4965 [2025-03-04 10:33:40,353 INFO L226 Difference]: Without dead ends: 2905 [2025-03-04 10:33:40,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 725 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=640, Invalid=5060, Unknown=0, NotChecked=0, Total=5700 [2025-03-04 10:33:40,360 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 239 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:40,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 419 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2025-03-04 10:33:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2817. [2025-03-04 10:33:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2262 states have (on average 1.1308576480990273) internal successors, (2558), 2236 states have internal predecessors, (2558), 357 states have call successors, (357), 117 states have call predecessors, (357), 194 states have return successors, (1585), 463 states have call predecessors, (1585), 357 states have call successors, (1585) [2025-03-04 10:33:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4500 transitions. [2025-03-04 10:33:40,727 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4500 transitions. Word has length 373 [2025-03-04 10:33:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:40,729 INFO L471 AbstractCegarLoop]: Abstraction has 2817 states and 4500 transitions. [2025-03-04 10:33:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.888888888888889) internal successors, (140), 34 states have internal predecessors, (140), 16 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (23), 14 states have call predecessors, (23), 14 states have call successors, (23) [2025-03-04 10:33:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4500 transitions. [2025-03-04 10:33:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-03-04 10:33:40,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:40,732 INFO L218 NwaCegarLoop]: trace histogram [51, 45, 35, 22, 18, 18, 18, 18, 16, 16, 16, 16, 16, 16, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:40,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:33:40,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:40,934 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:40,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1678742145, now seen corresponding path program 10 times [2025-03-04 10:33:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138087698] [2025-03-04 10:33:40,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:40,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 491 statements into 2 equivalence classes. [2025-03-04 10:33:40,958 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 319 of 491 statements. [2025-03-04 10:33:40,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 1391 proven. 860 refuted. 0 times theorem prover too weak. 4712 trivial. 0 not checked. [2025-03-04 10:33:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138087698] [2025-03-04 10:33:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138087698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314115306] [2025-03-04 10:33:41,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:33:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:41,258 INFO L229 MonitoredProcess]: Starting monitored process 34 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:33:41,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:33:41,315 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 491 statements into 2 equivalence classes. [2025-03-04 10:33:41,375 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 319 of 491 statements. [2025-03-04 10:33:41,375 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:33:41,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:41,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:33:41,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 3566 proven. 331 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2025-03-04 10:33:41,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6963 backedges. 1391 proven. 861 refuted. 0 times theorem prover too weak. 4711 trivial. 0 not checked. [2025-03-04 10:33:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314115306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:42,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 25 [2025-03-04 10:33:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94394548] [2025-03-04 10:33:42,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:33:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:42,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:33:42,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:33:42,120 INFO L87 Difference]: Start difference. First operand 2817 states and 4500 transitions. Second operand has 25 states, 25 states have (on average 5.56) internal successors, (139), 23 states have internal predecessors, (139), 15 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-04 10:33:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:43,341 INFO L93 Difference]: Finished difference Result 6172 states and 11639 transitions. [2025-03-04 10:33:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 10:33:43,342 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 23 states have internal predecessors, (139), 15 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) Word has length 491 [2025-03-04 10:33:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:43,359 INFO L225 Difference]: With dead ends: 6172 [2025-03-04 10:33:43,359 INFO L226 Difference]: Without dead ends: 3910 [2025-03-04 10:33:43,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 981 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=760, Invalid=2780, Unknown=0, NotChecked=0, Total=3540 [2025-03-04 10:33:43,372 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 644 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:43,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 519 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:33:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2025-03-04 10:33:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 3559. [2025-03-04 10:33:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3559 states, 2852 states have (on average 1.134992987377279) internal successors, (3237), 2825 states have internal predecessors, (3237), 438 states have call successors, (438), 154 states have call predecessors, (438), 265 states have return successors, (2264), 579 states have call predecessors, (2264), 438 states have call successors, (2264) [2025-03-04 10:33:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 5939 transitions. [2025-03-04 10:33:43,874 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 5939 transitions. Word has length 491 [2025-03-04 10:33:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:43,874 INFO L471 AbstractCegarLoop]: Abstraction has 3559 states and 5939 transitions. [2025-03-04 10:33:43,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.56) internal successors, (139), 23 states have internal predecessors, (139), 15 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2025-03-04 10:33:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 5939 transitions. [2025-03-04 10:33:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-04 10:33:43,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:43,877 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 34, 18, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:33:43,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:44,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-04 10:33:44,078 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:44,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1159082903, now seen corresponding path program 11 times [2025-03-04 10:33:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:44,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399613428] [2025-03-04 10:33:44,078 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:44,086 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 475 statements into 18 equivalence classes. [2025-03-04 10:33:44,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 437 of 475 statements. [2025-03-04 10:33:44,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:33:44,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6411 backedges. 1033 proven. 760 refuted. 0 times theorem prover too weak. 4618 trivial. 0 not checked. [2025-03-04 10:33:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:44,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399613428] [2025-03-04 10:33:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399613428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19284597] [2025-03-04 10:33:44,687 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:44,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:44,701 INFO L229 MonitoredProcess]: Starting monitored process 35 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:33:44,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:33:44,764 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 475 statements into 18 equivalence classes. [2025-03-04 10:33:44,848 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 437 of 475 statements. [2025-03-04 10:33:44,849 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-04 10:33:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:44,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:33:44,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6411 backedges. 3436 proven. 118 refuted. 0 times theorem prover too weak. 2857 trivial. 0 not checked. [2025-03-04 10:33:44,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6411 backedges. 1115 proven. 391 refuted. 0 times theorem prover too weak. 4905 trivial. 0 not checked. [2025-03-04 10:33:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19284597] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:45,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:45,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 13] total 23 [2025-03-04 10:33:45,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466629930] [2025-03-04 10:33:45,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:45,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:33:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:45,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:33:45,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:33:45,374 INFO L87 Difference]: Start difference. First operand 3559 states and 5939 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 11 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 10:33:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:46,227 INFO L93 Difference]: Finished difference Result 6495 states and 11114 transitions. [2025-03-04 10:33:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:33:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 11 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) Word has length 475 [2025-03-04 10:33:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:46,242 INFO L225 Difference]: With dead ends: 6495 [2025-03-04 10:33:46,242 INFO L226 Difference]: Without dead ends: 3410 [2025-03-04 10:33:46,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 943 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=444, Invalid=1812, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:33:46,250 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 139 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:46,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 299 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:33:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2025-03-04 10:33:46,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3353. [2025-03-04 10:33:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 2686 states have (on average 1.1325390915860014) internal successors, (3042), 2661 states have internal predecessors, (3042), 410 states have call successors, (410), 141 states have call predecessors, (410), 253 states have return successors, (2172), 550 states have call predecessors, (2172), 410 states have call successors, (2172) [2025-03-04 10:33:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 5624 transitions. [2025-03-04 10:33:46,732 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 5624 transitions. Word has length 475 [2025-03-04 10:33:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 3353 states and 5624 transitions. [2025-03-04 10:33:46,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 11 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-04 10:33:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 5624 transitions. [2025-03-04 10:33:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-04 10:33:46,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:46,747 INFO L218 NwaCegarLoop]: trace histogram [40, 37, 30, 16, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:33:46,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:46,947 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1411934335, now seen corresponding path program 12 times [2025-03-04 10:33:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:46,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001815557] [2025-03-04 10:33:46,948 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:46,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:46,955 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 404 statements into 13 equivalence classes. [2025-03-04 10:33:46,957 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 47 of 404 statements. [2025-03-04 10:33:46,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:33:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 4394 trivial. 0 not checked. [2025-03-04 10:33:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001815557] [2025-03-04 10:33:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001815557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:33:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:33:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:33:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17144204] [2025-03-04 10:33:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:33:46,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:33:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:46,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:33:46,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:33:46,972 INFO L87 Difference]: Start difference. First operand 3353 states and 5624 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:33:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:47,392 INFO L93 Difference]: Finished difference Result 3354 states and 5624 transitions. [2025-03-04 10:33:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:33:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 404 [2025-03-04 10:33:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:47,410 INFO L225 Difference]: With dead ends: 3354 [2025-03-04 10:33:47,410 INFO L226 Difference]: Without dead ends: 3353 [2025-03-04 10:33:47,411 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:33:47,411 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:47,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:33:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2025-03-04 10:33:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 3293. [2025-03-04 10:33:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 2629 states have (on average 1.1240015214910613) internal successors, (2955), 2620 states have internal predecessors, (2955), 407 states have call successors, (407), 141 states have call predecessors, (407), 253 states have return successors, (2169), 531 states have call predecessors, (2169), 407 states have call successors, (2169) [2025-03-04 10:33:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 5531 transitions. [2025-03-04 10:33:47,968 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 5531 transitions. Word has length 404 [2025-03-04 10:33:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:47,969 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 5531 transitions. [2025-03-04 10:33:47,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:33:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 5531 transitions. [2025-03-04 10:33:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-04 10:33:47,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:47,972 INFO L218 NwaCegarLoop]: trace histogram [44, 43, 32, 17, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 12, 12, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:33:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-04 10:33:47,972 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:47,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1235673100, now seen corresponding path program 1 times [2025-03-04 10:33:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942265207] [2025-03-04 10:33:47,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:47,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-04 10:33:47,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-04 10:33:47,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:47,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5641 backedges. 437 proven. 152 refuted. 0 times theorem prover too weak. 5052 trivial. 0 not checked. [2025-03-04 10:33:48,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942265207] [2025-03-04 10:33:48,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942265207] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:48,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322894201] [2025-03-04 10:33:48,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:33:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:48,276 INFO L229 MonitoredProcess]: Starting monitored process 36 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:33:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:33:48,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-04 10:33:48,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-04 10:33:48,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:48,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:48,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:33:48,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5641 backedges. 2205 proven. 86 refuted. 0 times theorem prover too weak. 3350 trivial. 0 not checked. [2025-03-04 10:33:48,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5641 backedges. 437 proven. 152 refuted. 0 times theorem prover too weak. 5052 trivial. 0 not checked. [2025-03-04 10:33:48,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322894201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:48,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:48,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2025-03-04 10:33:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355497091] [2025-03-04 10:33:48,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:48,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:33:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:48,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:33:48,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:33:48,812 INFO L87 Difference]: Start difference. First operand 3293 states and 5531 transitions. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:33:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:49,500 INFO L93 Difference]: Finished difference Result 5581 states and 9328 transitions. [2025-03-04 10:33:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:33:49,500 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) Word has length 447 [2025-03-04 10:33:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:49,514 INFO L225 Difference]: With dead ends: 5581 [2025-03-04 10:33:49,514 INFO L226 Difference]: Without dead ends: 3461 [2025-03-04 10:33:49,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 873 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:33:49,519 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:49,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 592 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2025-03-04 10:33:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 3424. [2025-03-04 10:33:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 2753 states have (on average 1.1155103523428986) internal successors, (3071), 2722 states have internal predecessors, (3071), 414 states have call successors, (414), 141 states have call predecessors, (414), 253 states have return successors, (2185), 560 states have call predecessors, (2185), 412 states have call successors, (2185) [2025-03-04 10:33:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 5670 transitions. [2025-03-04 10:33:50,112 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 5670 transitions. Word has length 447 [2025-03-04 10:33:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:50,112 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 5670 transitions. [2025-03-04 10:33:50,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:33:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 5670 transitions. [2025-03-04 10:33:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-04 10:33:50,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:50,115 INFO L218 NwaCegarLoop]: trace histogram [44, 42, 33, 18, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:33:50,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-04 10:33:50,316 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 985820708, now seen corresponding path program 2 times [2025-03-04 10:33:50,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:50,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861859623] [2025-03-04 10:33:50,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:50,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 445 statements into 2 equivalence classes. [2025-03-04 10:33:50,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 10:33:50,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5588 backedges. 504 proven. 217 refuted. 0 times theorem prover too weak. 4867 trivial. 0 not checked. [2025-03-04 10:33:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861859623] [2025-03-04 10:33:50,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861859623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103185722] [2025-03-04 10:33:50,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:33:50,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:50,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:50,640 INFO L229 MonitoredProcess]: Starting monitored process 37 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:33:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-04 10:33:50,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 445 statements into 2 equivalence classes. [2025-03-04 10:33:50,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 10:33:50,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:33:50,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:50,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:33:50,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5588 backedges. 2865 proven. 122 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2025-03-04 10:33:50,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5588 backedges. 504 proven. 217 refuted. 0 times theorem prover too weak. 4867 trivial. 0 not checked. [2025-03-04 10:33:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103185722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:51,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 29 [2025-03-04 10:33:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471528012] [2025-03-04 10:33:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:33:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:51,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:33:51,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:33:51,244 INFO L87 Difference]: Start difference. First operand 3424 states and 5670 transitions. Second operand has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:33:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:51,876 INFO L93 Difference]: Finished difference Result 5461 states and 8975 transitions. [2025-03-04 10:33:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:33:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) Word has length 445 [2025-03-04 10:33:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:51,891 INFO L225 Difference]: With dead ends: 5461 [2025-03-04 10:33:51,891 INFO L226 Difference]: Without dead ends: 3308 [2025-03-04 10:33:51,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 863 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=1488, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:33:51,896 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:51,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 392 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:33:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2025-03-04 10:33:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 3308. [2025-03-04 10:33:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 2655 states have (on average 1.1160075329566854) internal successors, (2963), 2626 states have internal predecessors, (2963), 400 states have call successors, (400), 141 states have call predecessors, (400), 249 states have return successors, (2140), 540 states have call predecessors, (2140), 398 states have call successors, (2140) [2025-03-04 10:33:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 5503 transitions. [2025-03-04 10:33:52,353 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 5503 transitions. Word has length 445 [2025-03-04 10:33:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:52,353 INFO L471 AbstractCegarLoop]: Abstraction has 3308 states and 5503 transitions. [2025-03-04 10:33:52,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.7586206896551726) internal successors, (109), 29 states have internal predecessors, (109), 12 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 10:33:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 5503 transitions. [2025-03-04 10:33:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 10:33:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:52,356 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 46, 1, 1, 1, 1, 1, 1] [2025-03-04 10:33:52,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-04 10:33:52,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:52,556 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:33:52,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash -819486314, now seen corresponding path program 5 times [2025-03-04 10:33:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609093918] [2025-03-04 10:33:52,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:52,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 428 statements into 47 equivalence classes. [2025-03-04 10:33:52,625 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 10:33:52,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:33:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9729 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 10:33:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609093918] [2025-03-04 10:33:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609093918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280055817] [2025-03-04 10:33:55,931 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:33:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:55,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:55,933 INFO L229 MonitoredProcess]: Starting monitored process 38 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:33:55,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 10:33:55,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 428 statements into 47 equivalence classes. [2025-03-04 10:33:56,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 10:33:56,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:33:56,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:56,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-04 10:33:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9729 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 10:33:56,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9729 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-03-04 10:34:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280055817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:01,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-03-04 10:34:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915797572] [2025-03-04 10:34:01,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:01,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-04 10:34:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:01,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-04 10:34:01,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-04 10:34:01,072 INFO L87 Difference]: Start difference. First operand 3308 states and 5503 transitions. Second operand has 190 states, 189 states have (on average 2.037037037037037) internal successors, (385), 190 states have internal predecessors, (385), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 10:34:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:13,002 INFO L93 Difference]: Finished difference Result 19474 states and 52167 transitions. [2025-03-04 10:34:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-04 10:34:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 2.037037037037037) internal successors, (385), 190 states have internal predecessors, (385), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Word has length 428 [2025-03-04 10:34:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:13,101 INFO L225 Difference]: With dead ends: 19474 [2025-03-04 10:34:13,101 INFO L226 Difference]: Without dead ends: 19473 [2025-03-04 10:34:13,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-04 10:34:13,114 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:13,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:34:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19473 states. [2025-03-04 10:34:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19473 to 3548. [2025-03-04 10:34:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 2847 states have (on average 1.1250439058658237) internal successors, (3203), 2818 states have internal predecessors, (3203), 448 states have call successors, (448), 141 states have call predecessors, (448), 249 states have return successors, (2188), 588 states have call predecessors, (2188), 446 states have call successors, (2188) [2025-03-04 10:34:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 5839 transitions. [2025-03-04 10:34:14,684 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 5839 transitions. Word has length 428 [2025-03-04 10:34:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:14,685 INFO L471 AbstractCegarLoop]: Abstraction has 3548 states and 5839 transitions. [2025-03-04 10:34:14,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 2.037037037037037) internal successors, (385), 190 states have internal predecessors, (385), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-04 10:34:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 5839 transitions. [2025-03-04 10:34:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-04 10:34:14,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:14,689 INFO L218 NwaCegarLoop]: trace histogram [57, 55, 42, 24, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 15, 14, 14, 14, 14, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:34:14,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-04 10:34:14,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-04 10:34:14,889 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:34:14,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1503585154, now seen corresponding path program 3 times [2025-03-04 10:34:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886375059] [2025-03-04 10:34:14,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:14,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 571 statements into 18 equivalence classes. [2025-03-04 10:34:14,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 190 of 571 statements. [2025-03-04 10:34:14,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:34:14,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9429 backedges. 1048 proven. 21 refuted. 0 times theorem prover too weak. 8360 trivial. 0 not checked. [2025-03-04 10:34:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886375059] [2025-03-04 10:34:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886375059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826839653] [2025-03-04 10:34:14,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:34:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:14,998 INFO L229 MonitoredProcess]: Starting monitored process 39 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:34:15,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 10:34:15,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 571 statements into 18 equivalence classes. [2025-03-04 10:34:15,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 190 of 571 statements. [2025-03-04 10:34:15,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:34:15,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:15,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:34:15,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9429 backedges. 1048 proven. 19 refuted. 0 times theorem prover too weak. 8362 trivial. 0 not checked. [2025-03-04 10:34:15,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9429 backedges. 1048 proven. 21 refuted. 0 times theorem prover too weak. 8360 trivial. 0 not checked. [2025-03-04 10:34:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826839653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:15,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-04 10:34:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123008087] [2025-03-04 10:34:15,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:15,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:34:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:15,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:34:15,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:34:15,612 INFO L87 Difference]: Start difference. First operand 3548 states and 5839 transitions. Second operand has 17 states, 15 states have (on average 5.6) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:34:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:16,172 INFO L93 Difference]: Finished difference Result 5607 states and 9850 transitions. [2025-03-04 10:34:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:34:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 571 [2025-03-04 10:34:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:16,186 INFO L225 Difference]: With dead ends: 5607 [2025-03-04 10:34:16,186 INFO L226 Difference]: Without dead ends: 2675 [2025-03-04 10:34:16,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1133 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:34:16,198 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 98 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:16,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 241 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:34:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2025-03-04 10:34:16,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2640. [2025-03-04 10:34:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2124 states have (on average 1.1153483992467044) internal successors, (2369), 2109 states have internal predecessors, (2369), 349 states have call successors, (349), 110 states have call predecessors, (349), 163 states have return successors, (1157), 420 states have call predecessors, (1157), 346 states have call successors, (1157) [2025-03-04 10:34:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3875 transitions. [2025-03-04 10:34:16,614 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3875 transitions. Word has length 571 [2025-03-04 10:34:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 2640 states and 3875 transitions. [2025-03-04 10:34:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.6) internal successors, (84), 17 states have internal predecessors, (84), 6 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:34:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3875 transitions. [2025-03-04 10:34:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-04 10:34:16,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:16,619 INFO L218 NwaCegarLoop]: trace histogram [60, 58, 44, 25, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 15, 15, 15, 15, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:34:16,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-04 10:34:16,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 10:34:16,820 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:34:16,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:16,820 INFO L85 PathProgramCache]: Analyzing trace with hash -595583292, now seen corresponding path program 4 times [2025-03-04 10:34:16,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812218676] [2025-03-04 10:34:16,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:16,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 601 statements into 2 equivalence classes. [2025-03-04 10:34:16,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 389 of 601 statements. [2025-03-04 10:34:16,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:34:16,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10479 backedges. 1880 proven. 525 refuted. 0 times theorem prover too weak. 8074 trivial. 0 not checked. [2025-03-04 10:34:17,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812218676] [2025-03-04 10:34:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812218676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287288756] [2025-03-04 10:34:17,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:17,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:17,207 INFO L229 MonitoredProcess]: Starting monitored process 40 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:34:17,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 10:34:17,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 601 statements into 2 equivalence classes. [2025-03-04 10:34:17,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 389 of 601 statements. [2025-03-04 10:34:17,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:34:17,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:34:17,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10479 backedges. 3506 proven. 277 refuted. 0 times theorem prover too weak. 6696 trivial. 0 not checked. [2025-03-04 10:34:17,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10479 backedges. 1880 proven. 526 refuted. 0 times theorem prover too weak. 8073 trivial. 0 not checked. [2025-03-04 10:34:18,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287288756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:18,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:18,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 21] total 36 [2025-03-04 10:34:18,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466364675] [2025-03-04 10:34:18,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:18,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:34:18,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:18,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:34:18,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:34:18,566 INFO L87 Difference]: Start difference. First operand 2640 states and 3875 transitions. Second operand has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 35 states have internal predecessors, (175), 21 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-04 10:34:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:20,583 INFO L93 Difference]: Finished difference Result 5322 states and 9729 transitions. [2025-03-04 10:34:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 10:34:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 35 states have internal predecessors, (175), 21 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) Word has length 601 [2025-03-04 10:34:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:20,598 INFO L225 Difference]: With dead ends: 5322 [2025-03-04 10:34:20,598 INFO L226 Difference]: Without dead ends: 3434 [2025-03-04 10:34:20,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1282 GetRequests, 1189 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1375, Invalid=5935, Unknown=0, NotChecked=0, Total=7310 [2025-03-04 10:34:20,604 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1023 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:20,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 900 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:34:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-03-04 10:34:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3130. [2025-03-04 10:34:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 2514 states have (on average 1.1268894192521877) internal successors, (2833), 2492 states have internal predecessors, (2833), 397 states have call successors, (397), 136 states have call predecessors, (397), 215 states have return successors, (2028), 501 states have call predecessors, (2028), 393 states have call successors, (2028) [2025-03-04 10:34:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 5258 transitions. [2025-03-04 10:34:21,144 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 5258 transitions. Word has length 601 [2025-03-04 10:34:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:21,145 INFO L471 AbstractCegarLoop]: Abstraction has 3130 states and 5258 transitions. [2025-03-04 10:34:21,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.861111111111111) internal successors, (175), 35 states have internal predecessors, (175), 21 states have call successors, (27), 5 states have call predecessors, (27), 11 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-04 10:34:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 5258 transitions. [2025-03-04 10:34:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-04 10:34:21,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:21,149 INFO L218 NwaCegarLoop]: trace histogram [55, 54, 40, 22, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 15, 14, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:34:21,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-03-04 10:34:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:21,350 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [partsErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, partsErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-04 10:34:21,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:21,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1793081225, now seen corresponding path program 5 times [2025-03-04 10:34:21,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:21,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891364332] [2025-03-04 10:34:21,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:21,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:21,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 556 statements into 18 equivalence classes. [2025-03-04 10:34:21,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 542 of 556 statements. [2025-03-04 10:34:21,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-04 10:34:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 1325 proven. 78 refuted. 0 times theorem prover too weak. 7508 trivial. 0 not checked. [2025-03-04 10:34:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:34:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891364332] [2025-03-04 10:34:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891364332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:34:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500579824] [2025-03-04 10:34:21,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:34:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:34:21,709 INFO L229 MonitoredProcess]: Starting monitored process 41 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:34:21,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-03-04 10:34:21,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 556 statements into 18 equivalence classes. [2025-03-04 10:34:21,856 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) and asserted 542 of 556 statements. [2025-03-04 10:34:21,856 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2025-03-04 10:34:21,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:34:21,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:34:21,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:34:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 1324 proven. 79 refuted. 0 times theorem prover too weak. 7508 trivial. 0 not checked. [2025-03-04 10:34:21,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:34:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 1324 proven. 80 refuted. 0 times theorem prover too weak. 7507 trivial. 0 not checked. [2025-03-04 10:34:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500579824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:34:22,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:34:22,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 22 [2025-03-04 10:34:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109957085] [2025-03-04 10:34:22,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:34:22,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:34:22,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:34:22,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:34:22,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:34:22,489 INFO L87 Difference]: Start difference. First operand 3130 states and 5258 transitions. Second operand has 22 states, 22 states have (on average 4.7727272727272725) internal successors, (105), 22 states have internal predecessors, (105), 12 states have call successors, (15), 1 states have call predecessors, (15), 6 states have return successors, (16), 8 states have call predecessors, (16), 12 states have call successors, (16)