./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/nla-digbench-scaling/fermat2-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 6c4c876bf3d38b01f54a088b76131bc8275dc44ae3ac622f7c3187fe3c7bf156 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:18:52,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:18:52,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:18:52,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:18:52,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:18:52,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:18:52,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:18:52,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:18:52,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:18:52,695 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:18:52,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:18:52,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:18:52,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:18:52,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:18:52,696 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:18:52,697 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:18:52,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:18:52,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:18:52,697 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c4c876bf3d38b01f54a088b76131bc8275dc44ae3ac622f7c3187fe3c7bf156 [2025-03-17 15:18:52,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:18:52,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:18:52,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:18:52,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:18:52,911 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:18:52,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.c [2025-03-17 15:18:54,024 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2c3dd/c4a43b796e03454290a33f925b19b93d/FLAGed5b80c8b [2025-03-17 15:18:54,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:18:54,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound10.c [2025-03-17 15:18:54,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2c3dd/c4a43b796e03454290a33f925b19b93d/FLAGed5b80c8b [2025-03-17 15:18:54,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bc2c3dd/c4a43b796e03454290a33f925b19b93d [2025-03-17 15:18:54,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:18:54,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:18:54,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:18:54,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:18:54,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:18:54,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf1a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54, skipping insertion in model container [2025-03-17 15:18:54,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:18:54,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:18:54,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:18:54,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:18:54,760 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:18:54,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54 WrapperNode [2025-03-17 15:18:54,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:18:54,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:18:54,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:18:54,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:18:54,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,788 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2025-03-17 15:18:54,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:18:54,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:18:54,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:18:54,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:18:54,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:18:54,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:18:54,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:18:54,823 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:18:54,823 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:18:54,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (1/1) ... [2025-03-17 15:18:54,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:18:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:54,853 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-17 15:18:54,857 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-17 15:18:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:18:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:18:54,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:18:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:18:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:18:54,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:18:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:18:54,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:18:54,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:18:54,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:18:55,215 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-17 15:18:55,215 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:18:55,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:18:55,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:18:55,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:55 BoogieIcfgContainer [2025-03-17 15:18:55,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:18:55,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:18:55,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:18:55,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:18:55,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:18:54" (1/3) ... [2025-03-17 15:18:55,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eb7daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:55, skipping insertion in model container [2025-03-17 15:18:55,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:18:54" (2/3) ... [2025-03-17 15:18:55,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75eb7daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:18:55, skipping insertion in model container [2025-03-17 15:18:55,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:18:55" (3/3) ... [2025-03-17 15:18:55,236 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound10.c [2025-03-17 15:18:55,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:18:55,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat2-ll_valuebound10.c that has 3 procedures, 133 locations, 1 initial locations, 1 loop locations, and 56 error locations. [2025-03-17 15:18:55,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:18:55,292 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;@241ab736, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:18:55,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-17 15:18:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:18:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:18:55,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:55,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:55,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash -829246380, now seen corresponding path program 1 times [2025-03-17 15:18:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:55,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131970560] [2025-03-17 15:18:55,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:55,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:18:55,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:18:55,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:55,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:18:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131970560] [2025-03-17 15:18:55,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131970560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:55,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:55,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639207322] [2025-03-17 15:18:55,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:55,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:55,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:55,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:55,442 INFO L87 Difference]: Start difference. First operand has 133 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 124 states have internal predecessors, (129), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:55,512 INFO L93 Difference]: Finished difference Result 254 states and 285 transitions. [2025-03-17 15:18:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2025-03-17 15:18:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:55,519 INFO L225 Difference]: With dead ends: 254 [2025-03-17 15:18:55,519 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 15:18:55,522 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-17 15:18:55,525 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:55,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 206 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 15:18:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 15:18:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 111 states have internal predecessors, (113), 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-17 15:18:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2025-03-17 15:18:55,555 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 13 [2025-03-17 15:18:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:55,556 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2025-03-17 15:18:55,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2025-03-17 15:18:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 15:18:55,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:55,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:18:55,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 63166084, now seen corresponding path program 1 times [2025-03-17 15:18:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558136813] [2025-03-17 15:18:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:55,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 15:18:55,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 15:18:55,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:55,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:18:55,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558136813] [2025-03-17 15:18:55,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558136813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:55,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634973548] [2025-03-17 15:18:55,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:55,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:55,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:55,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:55,594 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:55,629 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2025-03-17 15:18:55,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-17 15:18:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:55,632 INFO L225 Difference]: With dead ends: 119 [2025-03-17 15:18:55,633 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 15:18:55,633 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-17 15:18:55,633 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:55,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 197 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 15:18:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 15:18:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.6515151515151516) internal successors, (109), 107 states have internal predecessors, (109), 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-17 15:18:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-17 15:18:55,639 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 14 [2025-03-17 15:18:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:55,639 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-17 15:18:55,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:18:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-17 15:18:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 15:18:55,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:55,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:55,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:18:55,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:55,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 961892864, now seen corresponding path program 1 times [2025-03-17 15:18:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:55,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037072986] [2025-03-17 15:18:55,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:55,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:18:55,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:18:55,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:55,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030891619] [2025-03-17 15:18:55,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:55,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:55,663 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-17 15:18:55,665 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-17 15:18:55,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 15:18:55,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 15:18:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:55,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:18:55,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 15:18:55,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037072986] [2025-03-17 15:18:55,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:55,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030891619] [2025-03-17 15:18:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030891619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:55,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:18:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723963044] [2025-03-17 15:18:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:55,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:18:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:55,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:18:55,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:18:55,778 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:18:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:55,862 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2025-03-17 15:18:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:18:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-17 15:18:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:55,864 INFO L225 Difference]: With dead ends: 115 [2025-03-17 15:18:55,864 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 15:18:55,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:18:55,864 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:55,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 371 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 15:18:55,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 15:18:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.621212121212121) internal successors, (107), 105 states have internal predecessors, (107), 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-17 15:18:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-17 15:18:55,870 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 18 [2025-03-17 15:18:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:55,871 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-17 15:18:55,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:18:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-17 15:18:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:18:55,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:55,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:55,878 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-17 15:18:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:56,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 136539210, now seen corresponding path program 1 times [2025-03-17 15:18:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33400359] [2025-03-17 15:18:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:18:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:18:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915560599] [2025-03-17 15:18:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:56,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:56,113 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-17 15:18:56,115 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-17 15:18:56,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:18:56,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:18:56,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:56,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:56,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:18:56,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:56,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:18:56,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33400359] [2025-03-17 15:18:56,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915560599] [2025-03-17 15:18:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915560599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:56,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:18:56,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-17 15:18:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748243906] [2025-03-17 15:18:56,319 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:18:56,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:18:56,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:56,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:18:56,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:18:56,320 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:18:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:56,375 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2025-03-17 15:18:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:18:56,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2025-03-17 15:18:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:56,377 INFO L225 Difference]: With dead ends: 113 [2025-03-17 15:18:56,377 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 15:18:56,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:18:56,378 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:56,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 287 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 15:18:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 15:18:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 102 states have internal predecessors, (104), 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-17 15:18:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-17 15:18:56,390 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 35 [2025-03-17 15:18:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:56,391 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-17 15:18:56,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:18:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-17 15:18:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:18:56,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:56,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:56,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:18:56,592 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,SelfDestructingSolverStorable3 [2025-03-17 15:18:56,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:56,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -62251724, now seen corresponding path program 1 times [2025-03-17 15:18:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:56,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794902224] [2025-03-17 15:18:56,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:56,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:18:56,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:18:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:56,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794902224] [2025-03-17 15:18:56,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794902224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:56,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426189716] [2025-03-17 15:18:56,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:56,768 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-17 15:18:56,770 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-17 15:18:56,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:18:56,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:18:56,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:56,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:56,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:18:56,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:56,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426189716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:18:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 15:18:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565978024] [2025-03-17 15:18:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:18:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:56,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:18:56,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:18:56,879 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:56,967 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2025-03-17 15:18:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:18:56,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2025-03-17 15:18:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:56,969 INFO L225 Difference]: With dead ends: 110 [2025-03-17 15:18:56,969 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 15:18:56,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:18:56,970 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:56,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 365 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 15:18:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 15:18:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 101 states have internal predecessors, (103), 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-17 15:18:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2025-03-17 15:18:56,975 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 36 [2025-03-17 15:18:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:56,975 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2025-03-17 15:18:56,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2025-03-17 15:18:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 15:18:56,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:56,976 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:56,981 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-17 15:18:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:57,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1929803385, now seen corresponding path program 1 times [2025-03-17 15:18:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256160236] [2025-03-17 15:18:57,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 15:18:57,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 15:18:57,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256160236] [2025-03-17 15:18:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256160236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384265613] [2025-03-17 15:18:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:57,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:57,224 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,259 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2025-03-17 15:18:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-03-17 15:18:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,262 INFO L225 Difference]: With dead ends: 111 [2025-03-17 15:18:57,262 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 15:18:57,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:57,263 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 155 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 15:18:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-17 15:18:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 102 states have internal predecessors, (104), 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-17 15:18:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-17 15:18:57,270 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 37 [2025-03-17 15:18:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-17 15:18:57,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-17 15:18:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 15:18:57,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,271 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:18:57,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 305637266, now seen corresponding path program 1 times [2025-03-17 15:18:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254022485] [2025-03-17 15:18:57,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 15:18:57,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 15:18:57,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254022485] [2025-03-17 15:18:57,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254022485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:18:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798999681] [2025-03-17 15:18:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:18:57,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:18:57,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:18:57,317 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,376 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2025-03-17 15:18:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:18:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-03-17 15:18:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,377 INFO L225 Difference]: With dead ends: 112 [2025-03-17 15:18:57,377 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 15:18:57,377 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-17 15:18:57,377 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 206 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 15:18:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 15:18:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 103 states have internal predecessors, (105), 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-17 15:18:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2025-03-17 15:18:57,385 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 38 [2025-03-17 15:18:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2025-03-17 15:18:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2025-03-17 15:18:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 15:18:57,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,386 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:18:57,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash 884820709, now seen corresponding path program 1 times [2025-03-17 15:18:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365810528] [2025-03-17 15:18:57,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:18:57,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:18:57,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562349497] [2025-03-17 15:18:57,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:57,404 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-17 15:18:57,406 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-17 15:18:57,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 15:18:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 15:18:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:18:57,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:57,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365810528] [2025-03-17 15:18:57,452 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:57,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562349497] [2025-03-17 15:18:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562349497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:57,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:57,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218081158] [2025-03-17 15:18:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:57,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:57,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:57,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:57,454 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:57,496 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2025-03-17 15:18:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-03-17 15:18:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:57,497 INFO L225 Difference]: With dead ends: 147 [2025-03-17 15:18:57,498 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 15:18:57,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-17 15:18:57,498 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:57,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 184 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:18:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 15:18:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 112. [2025-03-17 15:18:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.536231884057971) internal successors, (106), 104 states have internal predecessors, (106), 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-17 15:18:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2025-03-17 15:18:57,504 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 39 [2025-03-17 15:18:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:57,504 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2025-03-17 15:18:57,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2025-03-17 15:18:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 15:18:57,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:57,505 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:57,510 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-17 15:18:57,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:57,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:57,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1659638256, now seen corresponding path program 1 times [2025-03-17 15:18:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:57,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022370043] [2025-03-17 15:18:57,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:18:57,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:18:57,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:18:57,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022370043] [2025-03-17 15:18:57,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022370043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:57,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732572902] [2025-03-17 15:18:57,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:57,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:57,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:57,851 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-17 15:18:57,853 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-17 15:18:57,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 15:18:57,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 15:18:57,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:57,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:57,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:18:57,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:58,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:18:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732572902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:18:58,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:18:58,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-17 15:18:58,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773686751] [2025-03-17 15:18:58,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:18:58,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:18:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:58,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:18:58,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:18:58,231 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:18:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:58,536 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2025-03-17 15:18:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:18:58,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 40 [2025-03-17 15:18:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:58,537 INFO L225 Difference]: With dead ends: 147 [2025-03-17 15:18:58,537 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 15:18:58,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:18:58,538 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 173 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:58,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 622 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:18:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 15:18:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2025-03-17 15:18:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 105 states have internal predecessors, (107), 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-17 15:18:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2025-03-17 15:18:58,543 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 40 [2025-03-17 15:18:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:58,543 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2025-03-17 15:18:58,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 15:18:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2025-03-17 15:18:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:18:58,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:58,544 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:58,550 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-17 15:18:58,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:58,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:58,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1479498830, now seen corresponding path program 1 times [2025-03-17 15:18:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901573043] [2025-03-17 15:18:58,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:58,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:18:58,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:18:58,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1029358929] [2025-03-17 15:18:58,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:58,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:58,767 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-17 15:18:58,768 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-17 15:18:58,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:18:58,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:18:58,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:58,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:58,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:18:58,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:58,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:18:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:18:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901573043] [2025-03-17 15:18:59,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029358929] [2025-03-17 15:18:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029358929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:18:59,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:18:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 15:18:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985535618] [2025-03-17 15:18:59,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:18:59,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:18:59,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:59,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:18:59,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:18:59,013 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:18:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,405 INFO L93 Difference]: Finished difference Result 187 states and 211 transitions. [2025-03-17 15:18:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:18:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2025-03-17 15:18:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,406 INFO L225 Difference]: With dead ends: 187 [2025-03-17 15:18:59,406 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 15:18:59,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:18:59,407 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 167 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 286 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:18:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 15:18:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2025-03-17 15:18:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4621848739495797) internal successors, (174), 145 states have internal predecessors, (174), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:18:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2025-03-17 15:18:59,414 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 42 [2025-03-17 15:18:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2025-03-17 15:18:59,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:18:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2025-03-17 15:18:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:18:59,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,415 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:59,421 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-17 15:18:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 164202156, now seen corresponding path program 1 times [2025-03-17 15:18:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553753836] [2025-03-17 15:18:59,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:18:59,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:18:59,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:18:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507002140] [2025-03-17 15:18:59,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:18:59,628 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-17 15:18:59,629 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-17 15:18:59,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:18:59,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:18:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:18:59,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:18:59,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:18:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:18:59,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:18:59,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:18:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553753836] [2025-03-17 15:18:59,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:18:59,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507002140] [2025-03-17 15:18:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507002140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:18:59,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:18:59,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:18:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90072270] [2025-03-17 15:18:59,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:18:59,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:18:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:18:59,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:18:59,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:18:59,675 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:18:59,769 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2025-03-17 15:18:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:18:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2025-03-17 15:18:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:18:59,771 INFO L225 Difference]: With dead ends: 266 [2025-03-17 15:18:59,771 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:18:59,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-17 15:18:59,772 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:18:59,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:18:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:18:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2025-03-17 15:18:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.40625) internal successors, (270), 218 states have internal predecessors, (270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:18:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 286 transitions. [2025-03-17 15:18:59,780 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 286 transitions. Word has length 44 [2025-03-17 15:18:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:18:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 286 transitions. [2025-03-17 15:18:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:18:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 286 transitions. [2025-03-17 15:18:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:18:59,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:18:59,781 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:18:59,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:18:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:18:59,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:18:59,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:18:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1134214529, now seen corresponding path program 1 times [2025-03-17 15:18:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:18:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296912] [2025-03-17 15:18:59,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:18:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:18:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:18:59,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:18:59,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:18:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296912] [2025-03-17 15:19:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:00,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:19:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188347580] [2025-03-17 15:19:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:19:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:19:00,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:19:00,028 INFO L87 Difference]: Start difference. First operand 229 states and 286 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:00,112 INFO L93 Difference]: Finished difference Result 238 states and 287 transitions. [2025-03-17 15:19:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:19:00,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-17 15:19:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:00,113 INFO L225 Difference]: With dead ends: 238 [2025-03-17 15:19:00,113 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:19:00,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:19:00,114 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:00,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:19:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2025-03-17 15:19:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 218 states have internal predecessors, (268), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 284 transitions. [2025-03-17 15:19:00,124 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 284 transitions. Word has length 62 [2025-03-17 15:19:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:00,124 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 284 transitions. [2025-03-17 15:19:00,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 284 transitions. [2025-03-17 15:19:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 15:19:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:00,126 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 15:19:00,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1134214568, now seen corresponding path program 1 times [2025-03-17 15:19:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:00,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73067161] [2025-03-17 15:19:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 15:19:00,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 15:19:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73067161] [2025-03-17 15:19:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73067161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:00,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:00,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424397234] [2025-03-17 15:19:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:00,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:00,178 INFO L87 Difference]: Start difference. First operand 229 states and 284 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:00,267 INFO L93 Difference]: Finished difference Result 229 states and 284 transitions. [2025-03-17 15:19:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-17 15:19:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:00,269 INFO L225 Difference]: With dead ends: 229 [2025-03-17 15:19:00,269 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 15:19:00,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:19:00,269 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 100 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:00,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 171 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 15:19:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-17 15:19:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.375) internal successors, (264), 217 states have internal predecessors, (264), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2025-03-17 15:19:00,277 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 62 [2025-03-17 15:19:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:00,278 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2025-03-17 15:19:00,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2025-03-17 15:19:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:19:00,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:00,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:00,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:19:00,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 800912039, now seen corresponding path program 1 times [2025-03-17 15:19:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258258292] [2025-03-17 15:19:00,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:00,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:19:00,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:19:00,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258258292] [2025-03-17 15:19:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258258292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:00,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740986259] [2025-03-17 15:19:00,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:00,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:00,347 INFO L87 Difference]: Start difference. First operand 228 states and 280 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:00,496 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2025-03-17 15:19:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:00,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-17 15:19:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:00,497 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:19:00,497 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 15:19:00,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:19:00,498 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 147 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:00,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 15:19:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-03-17 15:19:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 192 states have (on average 1.3645833333333333) internal successors, (262), 217 states have internal predecessors, (262), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 278 transitions. [2025-03-17 15:19:00,510 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 278 transitions. Word has length 63 [2025-03-17 15:19:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:00,510 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 278 transitions. [2025-03-17 15:19:00,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 278 transitions. [2025-03-17 15:19:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 15:19:00,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:00,511 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:00,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:19:00,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:00,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 800913256, now seen corresponding path program 1 times [2025-03-17 15:19:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:00,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943453571] [2025-03-17 15:19:00,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 15:19:00,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 15:19:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943453571] [2025-03-17 15:19:00,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943453571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:00,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:00,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:19:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313715934] [2025-03-17 15:19:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:19:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:19:00,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:19:00,556 INFO L87 Difference]: Start difference. First operand 228 states and 278 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:00,642 INFO L93 Difference]: Finished difference Result 238 states and 288 transitions. [2025-03-17 15:19:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:19:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-17 15:19:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:00,644 INFO L225 Difference]: With dead ends: 238 [2025-03-17 15:19:00,644 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 15:19:00,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:00,645 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 49 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:00,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 160 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 15:19:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2025-03-17 15:19:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 192 states have (on average 1.34375) internal successors, (258), 216 states have internal predecessors, (258), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2025-03-17 15:19:00,654 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 63 [2025-03-17 15:19:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2025-03-17 15:19:00,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2025-03-17 15:19:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:19:00,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:00,655 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:00,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:19:00,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:00,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:00,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1427230518, now seen corresponding path program 1 times [2025-03-17 15:19:00,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:00,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997193400] [2025-03-17 15:19:00,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:00,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:00,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:00,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997193400] [2025-03-17 15:19:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997193400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293763112] [2025-03-17 15:19:00,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:00,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:00,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:00,747 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-17 15:19:00,748 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-17 15:19:00,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:00,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:00,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:00,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:00,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:19:00,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293763112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:19:00,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:19:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-17 15:19:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338449521] [2025-03-17 15:19:00,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:00,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:19:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:00,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:19:00,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:19:00,972 INFO L87 Difference]: Start difference. First operand 227 states and 274 transitions. Second operand has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 15:19:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:01,430 INFO L93 Difference]: Finished difference Result 293 states and 362 transitions. [2025-03-17 15:19:01,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 15:19:01,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 66 [2025-03-17 15:19:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:01,432 INFO L225 Difference]: With dead ends: 293 [2025-03-17 15:19:01,432 INFO L226 Difference]: Without dead ends: 291 [2025-03-17 15:19:01,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=335, Unknown=0, NotChecked=0, Total=506 [2025-03-17 15:19:01,432 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 377 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:01,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 329 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:19:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-17 15:19:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 234. [2025-03-17 15:19:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.3366834170854272) internal successors, (266), 223 states have internal predecessors, (266), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 282 transitions. [2025-03-17 15:19:01,441 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 282 transitions. Word has length 66 [2025-03-17 15:19:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 282 transitions. [2025-03-17 15:19:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.076923076923077) internal successors, (118), 14 states have internal predecessors, (118), 5 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 15:19:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 282 transitions. [2025-03-17 15:19:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:19:01,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:01,442 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:01,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:19:01,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 15:19:01,643 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:01,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:01,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1463494101, now seen corresponding path program 1 times [2025-03-17 15:19:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454107028] [2025-03-17 15:19:01,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:01,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:01,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:19:01,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:19:01,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:01,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:01,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:01,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454107028] [2025-03-17 15:19:01,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454107028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:19:01,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:19:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:19:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883505041] [2025-03-17 15:19:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:19:01,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:19:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:19:01,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:19:01,713 INFO L87 Difference]: Start difference. First operand 234 states and 282 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:19:01,808 INFO L93 Difference]: Finished difference Result 236 states and 286 transitions. [2025-03-17 15:19:01,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:19:01,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-03-17 15:19:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:19:01,809 INFO L225 Difference]: With dead ends: 236 [2025-03-17 15:19:01,809 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 15:19:01,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:19:01,810 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:19:01,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 218 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:19:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 15:19:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2025-03-17 15:19:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 198 states have (on average 1.3181818181818181) internal successors, (261), 221 states have internal predecessors, (261), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 15:19:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 277 transitions. [2025-03-17 15:19:01,823 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 277 transitions. Word has length 66 [2025-03-17 15:19:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:19:01,823 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 277 transitions. [2025-03-17 15:19:01,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:19:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 277 transitions. [2025-03-17 15:19:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 15:19:01,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:19:01,825 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:19:01,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:19:01,825 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 53 more)] === [2025-03-17 15:19:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:19:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1294473155, now seen corresponding path program 1 times [2025-03-17 15:19:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:19:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115373475] [2025-03-17 15:19:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:19:01,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:19:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:19:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:19:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115373475] [2025-03-17 15:19:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115373475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:19:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122663280] [2025-03-17 15:19:01,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:19:01,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:19:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:19:01,906 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-17 15:19:01,908 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-17 15:19:01,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 15:19:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 15:19:01,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:19:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:19:01,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:19:01,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:19:19,935 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_45| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_45| |v_ULTIMATE.start_main_~R~0#1_45|))) (and (<= .cse0 9223372036854775807) (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0)))) is different from true [2025-03-17 15:19:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2025-03-17 15:19:19,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:19:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:19:21,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122663280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:19:21,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:19:21,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-17 15:19:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510543266] [2025-03-17 15:19:21,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:19:21,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:19:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:19:21,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:19:21,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=105, Unknown=7, NotChecked=22, Total=182 [2025-03-17 15:19:21,023 INFO L87 Difference]: Start difference. First operand 232 states and 277 transitions. Second operand has 14 states, 13 states have (on average 8.461538461538462) internal successors, (110), 14 states have internal predecessors, (110), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 15:19:25,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:34,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:46,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:53,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:57,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:19:59,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:03,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:04,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:08,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:13,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:18,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:22,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:23,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:27,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:31,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:32,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:36,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-17 15:20:38,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]